Cubic inflation, mirror graphs, regular maps, and partial cubes
From MaRDI portal
Publication:1422394
DOI10.1016/j.ejc.2003.09.004zbMath1031.05039OpenAlexW2016069483MaRDI QIDQ1422394
Boštjan Brešar, Alenka Lipovec, Bojan Mohar, Sandi Klavžar
Publication date: 14 February 2004
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2003.09.004
Graph embeddingsPlatonic graphsGraph automorphismsHypercubesBarycentric subdivisionIsometric subgraphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)
Related Items (7)
There are no finite partial cubes of girth more than 6 and minimum degree at least 3 ⋮ Hypercube embeddings and Cayley graphs generated by transpositions ⋮ Resonance graphs on perfect matchings of graphs on surfaces ⋮ \(\Theta\)-graceful labelings of partial cubes ⋮ Linear time algorithms on mirror trees ⋮ Characterization of 2-arc-transitive partial cubes ⋮ Mirror graphs: graph theoretical characterization of reflection arrangements and finite Coxeter groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The generation and classification of tile-k-transitive tilings of the Euclidean plane, the sphere and the hyperbolic plane
- Distance regular subgraphs of a cube
- Antipodal graphs and oriented matroids
- Isometric embedding in products of complete graphs
- Collapse of the metric hierarchy for bipartite graphs
- Lopsided sets and orthant-intersection by convex sets
- Distance-regular graphs the distance matrix of which has only one positive eigenvalue
- Realizations with a cut-through Eulerian circuit
- Shelling polyhedral 3-balls and 4-polytopes
- On the complexity of recognizing Hamming graphs and related classes of graphs
- Über den Zusammenhang symmetrischer Graphen
- Distance-preserving subgraphs of hypercubes
- Partial Cubes and Crossing Graphs
- n‐cubes and median graphs
- Hypermetric Spaces and the Hamming Cone
- Isometric subgraphs of Hamming graphs and d-convexity
- Recognizing binary Hamming graphs inO(n 2 logn) time
- Connectivity of transitive graphs
- On the Addressing Problem for Loop Switching
- Geometry of cuts and metrics
This page was built for publication: Cubic inflation, mirror graphs, regular maps, and partial cubes