Properties, proved and conjectured, of Keller, Mycielski, and queen graphs

DOI10.26493/1855-3974.1143.844zbMath1380.05066arXiv1606.07918OpenAlexW2963808953WikidataQ129359183 ScholiaQ129359183MaRDI QIDQ4604531

Stan Wagon, Peter W. Saltzman, Witold Jarnicki, Wendy J. Myrvold

Publication date: 26 February 2018

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

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

zbMATH Keywords

Hamiltonianedge coloringclass oneMycielski graphsKeller graphsqueen graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items

Unnamed Item ⋮ Hamilton-connected Mycielski \(\mathrm{graphs}^\ast\) ⋮ Extended Keller graph and its properties

Uses Software

• OEIS
• Wolfram Demonstrations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamilton connected graphs
• Méthode et théorème général de coloration des aretes d'un multigraphe
• Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
• A cube tiling of dimension eight with no facesharing
• Vertex-transitive graphs that have no Hamilton decomposition
• Hamilton decompositions of regular expanders: applications
• Laceable knights
• Regular Graphs of High Degree are 1-Factorizable
• Proof of the 1-factorization and Hamilton Decomposition Conjectures