Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes

DOI10.1016/0012-365X(95)00235-OzbMath0870.05031MaRDI QIDQ1356432

Marco Buratti

Publication date: 14 September 1997

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

zbMATH Keywords

hypercubecharacterizationCayley graphsedge-colouring

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Cayley, Marty and Schreier hypergraphs ⋮ Reconstructing subgraph-counting graph polynomials of increasing families of graphs ⋮ Schubert graphs, symmetric groups and flags of Boolean lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Distance monotone graphs and a new characterization of hypercubes
• A characterization of hypercubes
• Schubert graphs, symmetric groups and flags of Boolean lattices
• Parallel concepts in graph theory
• Cayley, Marty and Schreier hypergraphs
• $B$-valuations of graphs

This page was built for publication: Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes