Circuits containing specified edges
From MaRDI portal
Publication:1239747
DOI10.1016/0095-8956(77)90072-7zbMath0362.05069OpenAlexW1985580131MaRDI QIDQ1239747
Publication date: 1977
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(77)90072-7
Related Items (15)
Contractible edges in 3-connected graphs ⋮ On a cycle through a specified linear forest of a graph ⋮ On circuits through five edges ⋮ An Improved Algorithm for Finding Cycles Through Elements ⋮ 2-linked graphs ⋮ A nine point theorem for 3-connected graphs ⋮ Circuits through specified edges ⋮ Cycles through specified vertices of a graph ⋮ Cycle traversability for claw-free graphs and polyhedral maps ⋮ Note on circuits containing specified edges ⋮ Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs ⋮ Paths and cycles concerning independence edges ⋮ Clique or hole in claw-free graphs ⋮ Girth in graphs ⋮ One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
Cites Work
This page was built for publication: Circuits containing specified edges
