Gallai's problem on Dirac's construction

DOI10.1016/0012-365X(92)90615-MzbMath0766.05031OpenAlexW1971477663MaRDI QIDQ1197042

D. A. Youngs

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90615-m

zbMATH Keywords

color-critical graphsDirac's constructionGallai's problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Note on a conjecture of Toft

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Balanced graphs and noncovering graphs
• Hajos' graph-coloring conjecture: Variations and counterexamples
• A Theorem on n-Coloring the Points of a Linear Graph
• On Colouring Partial Joins of a Complete Graph and a Cycle
• Small graphs with chromatic number 5: A computer search
• Nombre chromatique et plus longs chemins d'un graphe

This page was built for publication: Gallai's problem on Dirac's construction