On a cycle through a specified linear forest of a graph
From MaRDI portal
Publication:868359
DOI10.1016/J.DISC.2005.11.043zbMATH Open1114.05052OpenAlexW2019434459MaRDI QIDQ868359FDOQ868359
Publication date: 2 March 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.043
Recommendations
- Partitions of a graph into cycles containing a specified linear forest
- On a tree graph defined by a set of cycles
- Linear forests and ordered cycles
- Pancyclic graphs and linear forests
- Hamiltonian cycles and dominating cycles passing through a linear forest
- A degree sum condition for long cycles passing through a linear forest
- scientific article; zbMATH DE number 2199618
- Ciclos hamiltonianos que pasan a través de un bosque lineal en grafos bipartitos balanceados
- Hamiltonian cycles containing ordered linear forests
- On cycle transversals and their connected variants in the absence of a small linear forest
Cites Work
- Title not available (Why is that?)
- Cycles through subsets with large degree sums
- Circuits through specified edges
- Long cycles through a linear forest
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Cycles and Connectivity in Graphs
- Circuits containing specified edges
- One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
- On paths and cycles through specified vertices
- Menger's theorem
Cited In (4)
This page was built for publication: On a cycle through a specified linear forest of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868359)
