On removable cycles through every edge

DOI10.1002/jgt.10082zbMath1009.05083OpenAlexW4233406293MaRDI QIDQ4797927

Manoel Lemos, James G. 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

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

Related Items (3)

Removable cycles avoiding two connected subgraphs ⋮ On small contractible subgraphs in 3-connected graphs of small average degree ⋮ A weaker version of Lovász' path removal conjecture

Cites Work

• Unnamed Item

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