Chords of longest circuits in locally planar graphs

DOI10.1016/J.EJC.2005.07.017zbMATH Open1105.05039OpenAlexW2074857413MaRDI QIDQ854834FDOQ854834

Authors: 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

Recommendations

• Chords of longest circuits in 3-connected graphs
• Chords of longest circuits of graphs embedded in torus and Klein bottle
• scientific article; zbMATH DE number 908142
• Chords of longest cycles in cubic graphs
• Intersecting longest paths in chordal graphs
• scientific article; zbMATH DE number 3922692
• Publication:4733880
• Chordal completions of planar graphs
• On the length of longest chordless cycles
• Chordal embeddings of planar graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

• Chords in longest cycles
• Results and problems on chorded cycles: a survey
• Removable edges and chords of longest cycles in 3-connected graphs
• Chords of longest circuits in 3-connected graphs
• A generalization of chordal graphs
• What is on his mind?
• Every longest circuit of a 3‐connected,K_3,3‐minor free graph has a chord
• A cycle of maximum order in a graph of high minimum degree has a chord
• Longest cycles and their chords
• Chords of longest circuits of graphs embedded in torus and Klein bottle

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

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