From the Coxeter Graph to the Klein Graph

DOI10.1002/jgt.20597zbMath1243.05174DBLPjournals/jgt/Dejter12arXiv1002.1960OpenAlexW1914188264WikidataQ29541067 ScholiaQ29541067MaRDI QIDQ2888875

Italo Jose Dejter

Publication date: 4 June 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

digraphshortest cycleultrahomogeneous grapharc-transitivity

Mathematics Subject Classification ID

Paths and cycles (05C38) Other designs, configurations (05B30) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Highly symmetric subgraphs of hypercubes
• On a \(\vec C_4\)-ultrahomogeneous oriented graph
• 6-transitive graphs
• Homogeneous graphs
• Why is PSL(2,7) ≅ GL(3,2)?
• A Polyhedral Realization of Felix Klein's Map {3, 7}₈ on a Riemann Surface of Genus 3
• On a {K_4,K_{2,2,2}}-ultrahomogeneous graph
• Countable Ultrahomogeneous Undirected Graphs
• Smoothly Embeddable Subgraphs
• On Homogeneous Graphs
• The Square of a Hamiltonian Cycle
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
• The edge‐transitive but not vertex‐transitive cubic graph on 112 vertices
• Variations on the Hamiltonian Theme
• Self-dual configurations and regular graphs
• Sur l'extension aux relations de quelques propriétés des ordres

This page was built for publication: From the Coxeter Graph to the Klein Graph