Chromatic number and girth

DOI10.1007/BF02018401zbMath0313.05107MaRDI QIDQ1220081

Roger J. Cook

Publication date: 1975

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Coloring graphs with fixed genus and girth ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Some results in topological graph theory ⋮ High-girth graphs avoiding a minor are nearly bipartite ⋮ Point Partition Numbers and Girth

Cites Work

• Unnamed Item
• Unnamed Item
• A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
• Graph Theory and Probability
• On circuits and subgraphs of chromatic graphs
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• A 4-Color Theorem for Toroidal Graphs

This page was built for publication: Chromatic number and girth