Long cycles in bipartite graphs

DOI10.1016/0095-8956(85)90077-2zbMath0566.05036OpenAlexW1981693422MaRDI QIDQ1059086

Bill Jackson

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(85)90077-2

zbMATH Keywords

lengthlong cycles2-connected bipartite graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (14)

The largest eigenvalue conditions for Hamiltonian and traceable graphs ⋮ Locating pairs of vertices on a Hamiltonian cycle in bigraphs ⋮ Polychromatic colorings of 1-regular and 2-regular subgraphs of complete graphs ⋮ Unnamed Item ⋮ Degree sum conditions for cyclability in bipartite graphs ⋮ Minimum degree conditions for the proper connection number of graphs ⋮ A panconnectivity theorem for bipartite graphs ⋮ Exact bipartite Turán numbers of large even cycles ⋮ Comparing invariants of toric ideals of bipartite graphs ⋮ Long cycles in unbalanced bipartite graphs ⋮ Super-pancyclic hypergraphs and bipartite graphs ⋮ Conditions for a bigraph to be super-cyclic ⋮ On the minimum degree and the proper connection number of graphs ⋮ Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs

Cites Work

• Cycles in bipartite graphs
• Maximal circuits of graphs. I
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Long cycles in bipartite graphs