Biclosure and bistability in a balanced bipartite graph

DOI10.1002/JGT.3190200414zbMath0838.05096OpenAlexW1990425712MaRDI QIDQ4857450

Oscar Ordaz, Pedro Mago, Denise Amar, Odile Favaron

Publication date: 30 May 1996

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190200414

zbMATH Keywords

pathscyclesbistabilitybalanced bipartite graph\(k\)-biclosure

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

New sufficient conditions for bipancyclic bipartite graphs ⋮ Bipartite independent number and Hamilton-biconnectedness of bipartite graphs ⋮ Some new sufficient conditions for 2p-Hamilton-biconnectedness of graphs ⋮ Some generalizations of spectral conditions for 2s-hamiltonicity and 2s-traceability of bipartite graphs ⋮ Sufficient conditions for graphs to be spanning connected ⋮ A panconnectivity theorem for bipartite graphs ⋮ Degree sequence conditions for a graph to be disjoint path coverable ⋮ Panconnectivity in bipartite graphs with large degree sum

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Biclosure and bistability in a balanced bipartite graph