The graph constructions ofHaj�s and Ore

DOI10.1002/(SICI)1097-0118(199712)26:4%3C211::AID-JGT5%3E3.0.CO;2-TMaRDI QIDQ4376497zbMATH OpenOpenAlexFDO

Authors Alasdair Urquhart

Publication date 8 April 1998

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199712)26:4%3C211::aid-jgt5%3E3.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)

Recommendations

• Hajós and Ore constructions for digraphs
• Haj�s constructions of critical graphs
• On the Hajós number of graphs
• On constructions of hypotraceable graphs
• Hajós' conjecture and projective graphs
• The Construction of Certain Graphs
• On the construction of certain graphs
• The graphs satisfying conditions of Ore's type
• The H-force sets of the graphs satisfying the condition of Ore's theorem
• On hypohamiltonian and almost hypohamiltonian graphs

Cited in

(10)

• Chromatic capacities of graphs and hypergraphs
• Hajós' theorem for list coloring
• Hajós and Ore constructions for digraphs
• Hajós theorem for colorings of edge-weighted graphs
• scientific article; zbMATH DE number 4002120 (Why is no real title available?)
• Haj�s constructions of critical graphs
• Hajós' theorem for list colorings of hypergraphs
• A Logical Autobiography
• Hajós-type constructions and neighborhood complexes
• How to construct the symmetric cycle of length 5 using Haj\'os construction with an adapted Rank Genetic Algorithm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376497)