Bipartite toughness and k-factors in bipartite graphs
From MaRDI portal
Publication:1008540
DOI10.1155/2008/597408zbMATH Open1157.05323OpenAlexW2003347187WikidataQ58644802 ScholiaQ58644802MaRDI QIDQ1008540FDOQ1008540
Authors: Jianbo Qian, Jonathan Z. Sun, Rui Xu, Guizhen 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
Recommendations
Cites Work
- Graph theory with applications
- Title not available (Why is that?)
- Hamiltonian results inK1,3-free graphs
- Toughness, hamiltonicity and split graphs
- Not every 2-tough graph is Hamiltonian
- Toughness in graphs -- a survey
- Tough graphs and Hamiltonian circuits.
- Graph factors and factorization: 1985--2003: a survey
- Flows in infinite graphs
- Recognizing tough graphs is NP-hard
- Title not available (Why is that?)
- Toughness and the existence ofk-factors
- The toughness of split graphs
- Two sufficient conditions for a 2-factor in a bipartite graph
- Toughness and the existence of k-factors. II
- Toughness and the existence of \(k\)-factors. III
Cited In (6)
- Factors, spectral radius and toughness in bipartite graphs
- Vertex cut, eigenvalues, \([a,b]\)-factors and toughness of connected bipartite graphs
- On toughness and \((g,f)\)-factors in bipartite graphs
- Toughness and spectral radius in graphs
- Title not available (Why is that?)
- Toughness of graphs and \([2,b]\)-factors
This page was built for publication: Bipartite toughness and \(k\)-factors in bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008540)
