(m)-covering of a triangulation

DOI10.1016/0012-365X(86)90213-XzbMath0607.05030OpenAlexW2081852260MaRDI QIDQ1085172

Dominique Benard, Jean-Luc Fouquet, André Bouchet

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0012-365x(86)90213-x

zbMATH Keywords

triangular embeddingchromatic number of a graph2-dimensional manifold

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Related Items (2)

Nonorientable Hamilton cycle embeddings of complete tripartite graphs ⋮ Fold-2-covering triangular embeddings

Cites Work

• Constructing a covering triangulation by means of a nowhere-zero dual flow
• The genus of the symmetric quadripartite graph
• The existence of unavoidable sets of geographically good configurations
• Constructions of covering triangulations with folds
• A Contribution to the Theory of Chromatic Polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: (m)-covering of a triangulation