Bipartite independent number and Hamilton-biconnectedness of bipartite graphs
From MaRDI portal
Publication:2657037
DOI10.1007/s00373-020-02211-7zbMath1459.05150MaRDI QIDQ2657037
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
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C45: Eulerian and Hamiltonian graphs
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item