The Borodin-Kostochka conjecture for graphs containing a doubly critical edge

zbMath1157.05309MaRDI QIDQ1010594

Landon Rabern

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/129670

zbMATH Keywords

optimal coloringdouble critical edgelonely path lemmavertex disjoint paths

Mathematics Subject Classification ID

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

Related Items (2)

Special issue in honour of Landon Rabern ⋮ A problem in particle physics and its Bayesian analysis

This page was built for publication: The Borodin-Kostochka conjecture for graphs containing a doubly critical edge