Triangular embeddings of complete graphs from graceful labellings of paths

DOI10.1016/J.JCTB.2007.02.009MaRDI QIDQ2384805zbMATH OpenOpenAlexFDO

Authors Luis Goddyn, R. B. Richter, 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

zbMATH Keywords

complete graphcyclicgraceful labellingpathtriangulation

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments
• A simple construction of exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
• A simple construction for orientable triangular embeddings of the complete graphs on 12 s vertices
• Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)

Cites work

• A note on conservative graphs
• A note on the number of graceful labellings of paths
• Conservative graphs
• Exponential families of non-isomorphic triangulations of complete graphs
• Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 3450230 (Why is no real title available?)
• scientific article; zbMATH DE number 3332246 (Why is no real title available?)
• On the number of nonisomorphic orientable regular embeddings of complete graphs
• Recursive constructions for triangulations

Cited in

(12)

• On the asymptotic growth of bipartite graceful permutations
• Balanced equi-n-squares
• Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
• Minimum genus embeddings of the complete graph
• Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments
• Total embedding distributions of Ringel ladders
• Simultaneous current graph constructions for minimum triangulations and complete graph embeddings
• Computer search for graceful labeling: a survey
• Face distributions of embeddings of complete graphs
• Jungerman ladders and index 2 constructions for genus embeddings of dense regular graphs
• 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

This page was built for publication: Triangular embeddings of complete graphs from graceful labellings of paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2384805)