The graph constructions ofHaj�s and Ore

DOI<211::AID-JGT5>3.0.CO;2-T 10.1002/(SICI)1097-0118(199712)26:4<211::AID-JGT5>3.0.CO;2-TzbMath0886.05067OpenAlexW2988182729MaRDI QIDQ4376497

Alasdair Urquhart

Publication date: 8 April 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199712)26:4<211::aid-jgt5>3.0.co;2-t

zbMATH Keywords

chromatic numberHajós-\(q\)-constructible graphOre-\(q\)-constructible graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Hajós' theorem for list coloring ⋮ Hajós-Type Constructions and Neighborhood Complexes ⋮ Hajós and Ore constructions for digraphs ⋮ Chromatic capacities of graphs and hypergraphs ⋮ A Logical Autobiography

This page was built for publication: The graph constructions ofHaj�s and Ore