Cycle partitions of regular graphs
From MaRDI portal
Recommendations
- Cycle Partitions in Graphs
- Partition of a bipartite graph into cycles
- Partition of a graph into cycles and degenerated cycles
- scientific article; zbMATH DE number 2101287
- Partition of a graph into cycles and vertices
- Partition and disjoint cycles in digraphs
- Cyclic partitions of complete uniform hypergraphs
- Cycle partition of two-connected and two-edge connected graphs
- On partition dimension of some cycle-related graphs
- Cycle-regular graphs
Cites work
- A class of Hamiltonian regular graphs
- A note on the path cover number of regular graphs
- A proof of Sumner's universal tournament conjecture for large tournaments
- An approximate version of Sumner's universal tournament conjecture
- Covering cycles and \(k\)-term degree sums
- Covering vertices by cycles
- Dominating cycles in regular 3-connected graphs
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- Hamilton cycles in 2-connected regular bipartite graphs
- Hamilton cycles in regular 3-connected graphs
- Hamilton cycles in sparse robustly expanding digraphs
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Hamiltonian Cycles in Regular Graphs
- Hamiltonian degree sequences in digraphs
- scientific article; zbMATH DE number 4191728 (Why is no real title available?)
- scientific article; zbMATH DE number 3902690 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3590273 (Why is no real title available?)
- scientific article; zbMATH DE number 3993619 (Why is no real title available?)
- scientific article; zbMATH DE number 908781 (Why is no real title available?)
- scientific article; zbMATH DE number 3353326 (Why is no real title available?)
- Longest cycles in regular graphs
- Monochromatic cycle partitions of graphs with large minimum degree
- On vertex-disjoint paths in regular graphs
- Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs
- The robust component structure of dense regular graphs and applications
Cited in
(16)- Weak internal partition of regular graphs
- On vertex-disjoint paths in regular graphs
- Enomoto and Ota's conjecture holds for large graphs
- Internal partitions of regular graphs
- Mad Tea Party Cyclic Partitions
- scientific article; zbMATH DE number 5914863 (Why is no real title available?)
- scientific article; zbMATH DE number 6501194 (Why is no real title available?)
- A note on a cycle partition problem
- On the path partition of graphs
- Random perfect matchings in regular graphs
- Nearly Hamilton cycles in sublinear expanders and applications
- Cycle partitions in dense regular digraphs and oriented graphs
- Cycle partition of dense regular digraphs and oriented graphs (extended abstract)
- Random perfect matchings in regular graphs (extended abstract)
- Towards Graham's rearrangement conjecture via rainbow paths
- Deranged perfect matchings on complete graph and balanced complete r-partite graph
This page was built for publication: Cycle partitions of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886097)