Yet another look at the Gray graph

MaRDI QIDQ3407101zbMATH OpenFDO

Authors Tomaž Pisanski

Publication date 2 March 2010

Mathematics Subject Classification ID

Other designs, configurations (05B30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• The Gray graph revisited
• An infinite family of cubic edge- but not vertex-transitive graphs
• Semisymmetric graphs from polytopes
• Cubic semisymmetric graphs of order \(8p ^{3}\)
• The genus of the Gray graph is 7

Cited in

(10)

• The genus of the Gray graph is 7
• Most unbreakable murky graphs are bull-free
• The Gray graph revisited
• On a smallest topological triangle free (n₄) point-line configuration
• scientific article; zbMATH DE number 7603373 (Why is no real title available?)
• Splittable and unsplittable graphs and configurations
• Polycyclic geometric realizations of the Gray configuration
• The Gray graph is a unit-distance graph
• Semisymmetric graphs from polytopes
• Distance-residual subgraphs

This page was built for publication: Yet another look at the Gray graph

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