Edge density and independence ratio in triangle-free graphs with maximum degree three

Jerrold R. Griggs; Owen Murphy

doi:10.1016/0012-365x(94)00263-i

ScienceGate Book Chapters

JOURNAL ARTICLE

Edge density and independence ratio in triangle-free graphs with maximum degree three

Jerrold R. Griggs Owen Murphy

Year: 1996 Journal: Discrete Mathematics Vol: 152 (1-3)Pages: 157-170 Publisher: Elsevier BV

DOI: 10.1016/0012-365x(94)00263-i

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Degree (music) Combinatorics Independence (probability theory) Enhanced Data Rates for GSM Evolution Discrete mathematics Independence number Statistics Graph Artificial intelligence Computer science

Metrics

Cited By

0.97

FWCI (Field Weighted Citation Impact)

Refs

0.72

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

Edge density and independence ratio in triangle-free graphs with maximum degree three

Metrics

Citation History

Topics

Related Documents

Size and independence in triangle‐free graphs with maximum degree three

Largest bipartite subgraphs in triangle‐free graphs with maximum degree three

Triangle-free graphs whose independence number equals the degree

ON DEFECTIVE COLORINGS OF TRIANGLE-FREE GRAPHS WITH PRESCRIBED MAXIMUM DEGREE

Triangle-Free Graphs with Large Degree