Yet another look at the Gray graph

zbMATH Open1200.05104MaRDI QIDQ3407101FDOQ3407101

Tomaž Pisanski

Publication date: 2 March 2010

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

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)

Cited In (8)

• Semisymmetric graphs from polytopes
• The Gray graph revisited
• The genus of the Gray graph is 7
• Most unbreakable murky graphs are bull-free
• Title not available (Why is that?)
• Splittable and unsplittable graphs and configurations
• Distance-residual subgraphs
• On a smallest topological triangle free (n_4) point-line configuration

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)