Bipartite toughness and \(k\)-factors in bipartite graphs
From MaRDI portal
Publication:1008540
DOI10.1155/2008/597408zbMath1157.05323OpenAlexW2003347187WikidataQ58644802 ScholiaQ58644802MaRDI QIDQ1008540
Jianbo Qian, Jonathan Z. Sun, Rui Xu, Gui Zhen Liu
Publication date: 30 March 2009
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/55149
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph factors and factorization: 1985--2003: a survey
- Recognizing tough graphs is NP-hard
- Toughness and the existence of k-factors. II
- Toughness and the existence of \(k\)-factors. III
- The toughness of split graphs
- Toughness, hamiltonicity and split graphs
- Not every 2-tough graph is Hamiltonian
- Toughness in graphs -- a survey
- Tough graphs and Hamiltonian circuits.
- Hamiltonian results inK1,3-free graphs
- Toughness and the existence ofk-factors
- Two sufficient conditions for a 2-factor in a bipartite graph
- Flows in infinite graphs
