Chords of longest circuits in locally planar graphs

DOI10.1016/j.ejc.2005.07.017zbMath1105.05039OpenAlexW2074857413MaRDI QIDQ854834

Jianbing Niu, Cun-Quan Zhang, Ken-ichi Kawarabayashi

Publication date: 7 December 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2005.07.017

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

A cycle of maximum order in a graph of high minimum degree has a chord ⋮ Chords in longest cycles ⋮ Removable edges and chords of longest cycles in 3-connected graphs ⋮ What is on his mind? ⋮ Every longest circuit of a 3‐connected,K_3,3‐minor free graph has a chord ⋮ Results and problems on chorded cycles: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycles in graphs. (Workshop Cycles in Graphs held at Simon Fraser University, Burnaby, British Columbia, Canada, July 5 - August 20, 1982)
• Trees in triangulations
• 4-connected projective planar graphs are Hamiltonian
• Five-connected toroidal graphs are Hamiltonian
• Chords of longest circuits in 3-connected graphs
• Long cycles in graphs on a fixed surface
• A theorem on paths in locally planar triangulations
• Disjoint paths, planarizing cycles, and spanning walks
• A Theorem on Planar Graphs
• Longest cycles and their chords
• Chords of longest circuits of graphs embedded in torus and Klein bottle
• Polytopes, graphs, and complexes

This page was built for publication: Chords of longest circuits in locally planar graphs