Digraphs containing every possible pair of dicycles

DOI<154::AID-JGT4>3.0.CO;2-L 10.1002/1097-0118(200006)34:2<154::AID-JGT4>3.0.CO;2-LzbMath0946.05048OpenAlexW4233691479MaRDI QIDQ4489490

Hong Wang

Publication date: 18 October 2000

Full work available at URL: https://doi.org/10.1002/1097-0118(200006)34:2<154::aid-jgt4>3.0.co;2-l

zbMATH Keywords

digraphvertex-disjoint cycleshamiltonian path

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Disjoint Cycles in a Digraph with Partial Degree ⋮ Disjoint directed cycles with specified lengths in directed bipartite graphs ⋮ Disjoint directed cycles in directed graphs

Cites Work

• Unnamed Item

This page was built for publication: Digraphs containing every possible pair of dicycles