Hamiltonian properties and the bipartite independence number

DOI10.1016/0012-365X(95)00028-UzbMath0870.05047MaRDI QIDQ1356424

Denise Amar, Oscar Ordaz, Andre Raspaud

Publication date: 9 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

independence numberindependent setdigraphsperfect matchingcompatibilityhamiltonian path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

New sufficient conditions for bipancyclic bipartite graphs

Cites Work

• Cycles and paths of many lengths in bipartite digraphs
• On the bipartite independence number of a balanced bipartite graph
• Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
• Unnamed Item

This page was built for publication: Hamiltonian properties and the bipartite independence number