Cycle partition of dense regular digraphs and oriented graphs (extended abstract)
From MaRDI portal
Cites work
- A decomposition theorem for partially ordered sets
- A note on the path cover number of regular graphs
- An exact minimum degree condition for Hamilton cycles in oriented graphs
- Arc coverings of graphs
- Covering and packing in graphs IV: Linear arboricity
- Covering cycles and \(k\)-term degree sums
- Covering vertices by cycles
- Cycle partitions of regular graphs
- Extending perfect matchings to Hamiltonian cycles in line graphs
- Hamilton cycles in sparse robustly expanding digraphs
- Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Hamiltonian degree sequences in digraphs
- scientific article; zbMATH DE number 4191728 (Why is no real title available?)
- scientific article; zbMATH DE number 3149611 (Why is no real title available?)
- scientific article; zbMATH DE number 3165195 (Why is no real title available?)
- scientific article; zbMATH DE number 3722690 (Why is no real title available?)
- On \(F\)-Hamiltonian graphs
- On the path partition number of 6‐regular graphs
- On vertex-disjoint paths in regular graphs
- Perfect matchings extend to Hamilton cycles in hypercubes
- Some Theorems on Abstract Graphs
- Stability for vertex cycle covers
- The robust component structure of dense regular graphs and applications
This page was built for publication: Cycle partition of dense regular digraphs and oriented graphs (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6997027)
