Brooks' graph-coloring theorem and the independence number

DOI10.1016/0095-8956(79)90066-2zbMath0335.05108OpenAlexW1981871151MaRDI QIDQ1229220

Paul A. Catlin

Publication date: 1979

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(79)90066-2

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items

A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs, Vertex arboricity and maximum degree, Brooks' Theorem and Beyond, The toughness of cubic graphs, Well-hued graphs, The edge chromatic difference sequence of a cubic graph, Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration, Partitioning of a graph into induced subgraphs not containing prescribed cliques, Chromatic optimisation: Limitations, objectives, uses, references, A unified proof of Brooks' theorem and Catlin's theorem, Vertex partition of hypergraphs and maximum degenerate subhypergraphs, Recognizing Graphs Close to Bipartite Graphs, LDPC codes constructed from cubic symmetric graphs, On the maximum parsimony distance between phylogenetic trees

Cites Work

• Unnamed Item
• Unnamed Item