Bipartite independent number and Hamilton-biconnectedness of bipartite graphs

DOI10.1007/S00373-020-02211-7zbMath1459.05150OpenAlexW3085245180MaRDI QIDQ2657037

Bin Long Li

Publication date: 17 March 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-020-02211-7

zbMATH Keywords

Hamiltonicitybalanced bipartite graphbipartite independent numberHamilton-biconnectedness

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of Dirac's theorem
• A method in graph theory
• On the bipartite independence number of a balanced bipartite graph
• Hamiltonian cycles in bipartite graphs
• A note on Hamiltonian circuits
• On Hamiltonian bipartite graphs
• Note on Hamilton Circuits
• Maximal non- hamilton-laceable graphs
• Updating the hamiltonian problem—A survey
• Hamiltonian Properties of Bipartite Graphs and Digraphs with Bipartite Independence 2
• Biclosure and bistability in a balanced bipartite graph
• Some Theorems on Abstract Graphs

This page was built for publication: Bipartite independent number and Hamilton-biconnectedness of bipartite graphs