Digraphs containing every possible pair of dicycles

DOI10.1002/1097-0118(200006)34:2%3C154::AID-JGT4%3E3.0.CO;2-LzbMATH Open0946.05048OpenAlexW4233691479MaRDI QIDQ4489490FDOQ4489490

Authors: Hong Wang 

Publication date: 18 October 2000

Full work available at URL: https://doi.org/10.1002/1097-0118(200006)34:2%3C154::aid-jgt4%3E3.0.co;2-l

Recommendations

• Bipartite graphs containing every possible pair of cycles
• scientific article; zbMATH DE number 147647
• Graphs with every matching contained in a cycle
• Digraphs with maximum number of paths and cycles
• Almost given length cycles in digraphs
• Cycle decompositions of complete digraphs
• Cayley digraphs from complete generalized cycles
• On digraphs with no two disjoint directed cycles
• scientific article; zbMATH DE number 147643
• Dyck-Eulerian digraphs

zbMATH Keywords

digraphvertex-disjoint cycleshamiltonian path

Mathematics Subject Classification ID

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

Cites Work

• Graph theory with applications

Cited In (6)

• Title not available (Why is that?)
• Disjoint Cycles in a Digraph with Partial Degree
• Title not available (Why is that?)
• Title not available (Why is that?)
• Disjoint directed cycles in directed graphs
• Disjoint directed cycles with specified lengths in directed bipartite graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4489490)