On removable cycles through every edge

DOI10.1002/JGT.10082MaRDI QIDQ4797927zbMATH OpenOpenAlexFDO

Authors Manoel Lemos, James Oxley

Publication date 10 March 2003

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.10082

zbMATH Keywords

matroid2-connected graphremovable cycle

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Paths and cycles (05C38)

Recommendations

• Removable edges in cycles of a \(k\)-connected graph
• Removable Cycles in Planar Graphs
• Removable edges in a cycle of a 4-connected graph
• Removable edges of cycles in 5-connected graphs
• On removable cycles in graphs and digraphs
• scientific article; zbMATH DE number 1123790
• Removable edges in longest cycles of 4-connected graphs
• Cycles having the same modularity and removable edges in 2-connected graphs
• Removable cycles in non-bipartite graphs
• Removable cycles avoiding two connected subgraphs

Cites work

• Graph theory with applications

Cited in

(9)

• On removable cycles in graphs and digraphs
• On removable cycles in connected graphs.
• Vertex removable cycles of graphs and digraphs
• Removable cycles avoiding two connected subgraphs
• A weaker version of Lovász' path removal conjecture
• Removable Cycles in Planar Graphs
• On small contractible subgraphs in 3-connected graphs of small average degree
• 2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs
• Vertex disjoint non-separating cycles in graphs

This page was built for publication: On removable cycles through every edge

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