Removable edges and chords of longest cycles in 3-connected graphs
From MaRDI portal
Publication:2014727
DOI10.1007/S00373-013-1296-XzbMATH Open1291.05113OpenAlexW1998179088MaRDI QIDQ2014727FDOQ2014727
Authors: Jichang Wu, Haiyan Kang, Hajo Broersma 
Publication date: 16 June 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1296-x
Recommendations
Paths and cycles (05C38) Connectivity (05C40) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Chords of longest circuits in 3-connected graphs
- The number of removable edges in 3-connected graphs
- Removable edges in 3-connected graphs
- Chords of longest cycles in cubic graphs
- Every longest circuit of a 3‐connected,K3,3‐minor free graph has a chord
- Longest cycles and their chords
- Chords of longest circuits of graphs embedded in torus and Klein bottle
- Chords of longest circuits in locally planar graphs
Cited In (8)
- Chords in longest cycles
- The longest cycle problem is polynomial on interval graphs
- Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph
- Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph
- Contractible edges and removable edges in 3-connected graphs
- A cycle of maximum order in a graph of high minimum degree has a chord
- Longest cycles and their chords
- Title not available (Why is that?)
This page was built for publication: Removable edges and chords of longest cycles in 3-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014727)
