Finding complementary cycles in locally semicomplete digraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3914352 (Why is no real title available?)
- scientific article; zbMATH DE number 1498519 (Why is no real title available?)
- Complementary cycles of all lengths in tournaments
- Locally semicomplete digraphs: A generalization of tournaments
- Minimum cycle factors in quasi-transitive digraphs
- On complementary cycles in locally semicomplete digraphs
- The partition of a strong tournament
Cited in
(8)- Minimum cycle factors in quasi-transitive digraphs
- On complementary cycles in locally semicomplete digraphs
- Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties
- Tournaments and Semicomplete Digraphs
- Restricted cycle factors and arc-decompositions of digraphs
- LOCALLY SEMICOMPLETE DIGRAPHS WITH A FACTOR COMPOSED OF k CYCLES
- Locally Semicomplete Digraphs and Generalizations
- Degree constrained 2-partitions of semicomplete digraphs
This page was built for publication: Finding complementary cycles in locally semicomplete digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763478)