On a cycle through a specified linear forest of a graph
From MaRDI portal
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
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- Circuits containing specified edges
- Circuits through specified edges
- Cycles and Connectivity in Graphs
- Cycles through subsets with large degree sums
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Long cycles through a linear forest
- Menger's theorem
- On paths and cycles through specified vertices
- One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
Cited in
(4)- scientific article; zbMATH DE number 2199618 (Why is no real title available?)
- Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs
- A degree condition for cycles passing through specified vertices and edges
- scientific article; zbMATH DE number 7407637 (Why is no real title available?)
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)
