Face 2-Colorable Embeddings with Faces of Specified Lengths
From MaRDI portal
Publication:3188664
DOI10.1002/jgt.21902zbMath1342.05090OpenAlexW1923922730MaRDI QIDQ3188664
Barbara M. Maenhaut, Benjamin R. Smith
Publication date: 12 August 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21902
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A construction for biembeddings of Latin squares
- 2-cell embeddings with prescribed face lengths and genus
- Packing cycles in complete graphs
- A constraint on the biembedding of Latin squares
- Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs
- Greatest common divisors and least common multiples of graphs
- On decomposing \(K_n -I\) into cycles of a fixed odd length
- Common multiples of complete graphs and a 4-cycle
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Nonorientable biembeddings of Steiner triple systems
- An asymptotic solution to the cycle decomposition problem for complete graphs
- Heffter arrays and biembedding graphs on surfaces
- On biembeddings of Latin squares
- The nonorientable genus of joins of complete graphs with large edgeless graphs
- Cycle decompositions III: Complete graphs and fixed length cycles
- Decompositions of complete graphs into long cycles
- COMMON MULTIPLES OF COMPLETE GRAPHS
- BIEMBEDDINGS OF LATIN SQUARES AND HAMILTONIAN DECOMPOSITIONS
- Cycle decompositions V: Complete graphs into cycles of arbitrary lengths
