Highly symmetric subgraphs of hypercubes

DOI10.1023/A:1022472513494zbMath0788.05041OpenAlexW1584831215MaRDI QIDQ686980

Carsten Thomassen, Andries E. Brouwer, Italo Jose Dejter

Publication date: 13 October 1993

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022472513494

zbMATH Keywords

hypercubecoloringproblem of Erdősvertex-transitive induced subgraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

From the Coxeter Graph to the Klein Graph, Subgraphs of a hypercube containing no small even cycles, On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs, Hypercube embeddings and Cayley graphs generated by transpositions, Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube, Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets, Links between two semisymmetric graphs on 112 vertices via association schemes, Distance-residual subgraphs, Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube, New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces, Hexagon-free subgraphs of hypercubes, On symmetric subgraphs of the 7-cube: An overview

Cites Work

• On generalized hexagons and a near octagon whose lines have three points
• On edge but not vertex transitive regular graphs
• Hexagon-free subgraphs of hypercubes
• Subgraphs of a hypercube containing no small even cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item