A note on traversing specified vertices in graphs embedded with large representativity

DOI10.1016/J.DISC.2010.03.025zbMATH1214.05093OpenAlexW1990360550MaRDI QIDQ709309FDOQ709309

Authors Ken-ichi Kawarabayashi, Michael D. Plummer

Publication date 18 October 2010

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2010.03.025

zbMATH Keywords

genuscyclabilityface-widthrepresentativityplanarizing cycle

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• The 2-extendability of 5-connected graphs on surfaces with large representativity
• Circuits through prescribed vertices in k‐connected k‐regular graphs
• Subgraphs of graphs on surfaces with high representativity
• Cycles intersecting a prescribed vertex set
• Long cycles in graphs on a fixed surface

Cites work

• scientific article; zbMATH DE number 1002024 (Why is no real title available?)
• scientific article; zbMATH DE number 3425637 (Why is no real title available?)
• scientific article; zbMATH DE number 3783043 (Why is no real title available?)
• scientific article; zbMATH DE number 3460316 (Why is no real title available?)
• scientific article; zbMATH DE number 1454655 (Why is no real title available?)
• scientific article; zbMATH DE number 3310759 (Why is no real title available?)
• 4-connected projective planar graphs are Hamiltonian
• A Theorem on Planar Graphs
• A nine point theorem for 3-connected graphs
• A theorem on paths in locally planar triangulations
• A theorem on paths in planar graphs
• Color-critical graphs on a fixed surface
• Cycles through 23 vertices in 3-connected cubic planar graphs
• Disjoint paths, planarizing cycles, and spanning walks
• Five-coloring maps on surfaces
• Five-connected toroidal graphs are Hamiltonian
• Graphs on surfaces
• Hamiltonian circuits in some maps on the torus
• Hamiltonicity of 5‐Connected Toroidal Triangulations
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Long cycles in graphs on a fixed surface
• On Cycles and Connectivity in Planar Graphs
• On the matching extendability of graphs in surfaces
• Polytopes, graphs, and complexes
• Trees in triangulations
• When m vertices in a k-connected graph cannot be walked round along a simple cycle

This page was built for publication: A note on traversing specified vertices in graphs embedded with large representativity

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