Triangular embeddings of complete graphs from graceful labellings of paths
From MaRDI portal
Publication:2384805
DOI10.1016/j.jctb.2007.02.009zbMath1247.05205OpenAlexW2034442645MaRDI QIDQ2384805
R. Bruce Richter, Luis A. Goddyn, Jozef Širáň
Publication date: 10 October 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2007.02.009
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (11)
Minimum genus embeddings of the complete graph ⋮ Computer search for graceful labeling: a survey ⋮ Face distributions of embeddings of complete graphs ⋮ Total embedding distributions of Ringel ladders ⋮ Balanced equi-\(n\)-squares ⋮ On the asymptotic growth of bipartite graceful permutations ⋮ Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\) ⋮ Graceful labelling: state of the art, applications and future directions ⋮ Simultaneous current graph constructions for minimum triangulations and complete graph embeddings ⋮ Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments ⋮ Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
Cites Work
- Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
- Exponential families of non-isomorphic triangulations of complete graphs
- On the number of nonisomorphic orientable regular embeddings of complete graphs
- A note on the number of graceful labellings of paths
- A note on conservative graphs
- Conservative graphs
- Recursive constructions for triangulations
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Triangular embeddings of complete graphs from graceful labellings of paths
