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

DOI10.1016/J.DISC.2010.03.025zbMATH Open1214.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

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

zbMATH Keywords

genuscyclabilityface-widthrepresentativityplanarizing cycle

Mathematics Subject Classification ID

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

Cites Work

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

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)