Häggkvist-Hell graphs: A class of Kneser-colorable graphs

DOI10.1016/J.DISC.2011.10.011zbMath1237.05087arXiv1008.2199OpenAlexW1977305469MaRDI QIDQ764869

David E. Roberson

Publication date: 16 March 2012

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

Full work available at URL: https://arxiv.org/abs/1008.2199

zbMATH Keywords

automorphismindependent setchromatic numbertriangle-free graphKneser graphodd girth

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• Maximum bipartite subgraphs of Kneser graphs
• Universality of \(A\)-mote graphs
• The complexity of \(H\)-colouring of bounded degree graphs
• On the diameter of Kneser graphs

This page was built for publication: Häggkvist-Hell graphs: A class of Kneser-colorable graphs