Vertex disjoint 4-cycles in bipartite tournaments

DOI10.1016/J.DISC.2017.10.023MaRDI QIDQ1699558zbMATH OpenOpenAlexFDO

Authors C. Balbuena, Diego González-Moreno, M. Olsen

Publication date 23 February 2018

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2117/111583

zbMATH Keywords

vertex-disjoint cyclesbipartite tournamentminimum outdegreeprescribed lengthBermond-Thomassen conjecture

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Distance in graphs (05C12) Paths and cycles (05C38)

Recommendations

• Vertex-disjoint cycles in bipartite tournaments
• Vertex-disjoint cycles in bipartite tournaments
• Tournaments and bipartite tournaments without vertex disjoint cycles of different lengths
• Vertex-disjoint quadrilaterals in bipartite graphs
• Two disjoint cycles in digraphs

Cites work

• A step toward the Bermond-Thomassen conjecture about disjoint cycles in digraphs
• Cycles in digraphs– a survey
• Digraphs
• Disjoint 3-cycles in tournaments: a proof of the Bermond-Thomassen conjecture for tournaments
• Disjoint cycles in digraphs
• Disjoint directed cycles
• Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
• Vertex-disjoint cycles in bipartite tournaments

Cited in

(7)

• Disjoint cycles in tournaments and bipartite tournaments
• Vertex-disjoint 4-cycles containing specified edges in a bipartite graph
• Vertex-disjoint cycles in bipartite tournaments
• Vertex-disjoint cycles in bipartite tournaments
• Vertex-disjoint cycles in local tournaments
• Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments
• Vertex‐disjoint cycles of the same length in tournaments

This page was built for publication: Vertex disjoint 4-cycles in bipartite tournaments

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