Toughness and the existence ofk-factors
From MaRDI portal
Publication:3731636
DOI10.1002/jgt.3190090106zbMath0598.05054OpenAlexW2056002585MaRDI QIDQ3731636
Bill Jackson, Akira Saito, Hikoe Enomoto, P. Katerinis
Publication date: 1985
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190090106
Related Items
Toughness of graphs and \([2,b\)-factors], Long paths and cycles in tough graphs, Toughness and Hamiltonicity of a class of planar graphs, Spanning trees and spanning closed walks with small degrees, Hamiltonian degree conditions for tough graphs, Toughness and edge-toughness, Path partition number in tough graphs, Local topological toughness and local factors, Toughness and the existence of k-factors. II, On a closure concept in claw-free graphs, 1-tough cocomparability graphs are hamiltonian, Minimum degree, independence number and regular factors, Graph factors and factorization: 1985--2003: a survey, The complexity of recognizing tough cubic graphs, Toughness, hamiltonicity and split graphs, Better approximations of non-Hamiltonian graphs, On the Toughness of a Graph, Degree sequences and the existence of \(k\)-factors, Vizing's 2-factor conjecture involving toughness and maximum degree conditions, Characterization of 1-tough graphs using factors, Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs, Toughness and spanning trees in K4‐minor‐free graphs, Forbidden subgraphs and 2‐factors in 3/2‐tough graphs, Eigenvalues and [a,b‐factors in regular graphs], Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor, Strong Tutte type conditions and factors of graphs, Sufficient conditions for graphs to have strong parity factors, Wiener index and vulnerability parameters of graphs, Toughness for fractional \((2, b, k)\)-critical covered graphs, Existence of 2-factors in tough graphs without forbidden subgraphs, Toughness and \((a,b,k)\)-critical graphs, Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey, Graph toughness from Laplacian eigenvalues, Toughness, Hamiltonicity and spectral radius in graphs, Research on fractional critical covered graphs, Recognizing tough graphs is NP-hard, Not every 2-tough graph is Hamiltonian, Chordality and 2-factors in tough graphs, How many conjectures can you stand? A survey, Pseudo-Hamiltonian-connected graphs, Maximum fractional factors in graphs, Toughness and the existence of fractional \(k\)-factors of graphs, On Toughness and Hamiltonicity of 2K2‐Free Graphs, Partitioning vertices of 1-tough graphs into paths, Toughness in graphs -- a survey, The existence of \(k\)-factors in squares of graphs, A note on interconnecting matchings in graphs, Various results on the toughness of graphs, Algebraic conditions for t-tough graphs, Bipartite toughness and \(k\)-factors in bipartite graphs, Toughness of graphs and the existence of factors, Toughness and \([a, b\)-factors with inclusion\(/\)exclusion properties], Toughness and matching extension in graphs, Unnamed Item, Toughness and prism-Hamiltonicity of \(P_4\)-free graphs, Toughness and the existence of \(k\)-factors. III, 2-factors and Hamiltonicity, Chvátal’s t 0-Tough Conjecture, Connected \(k\)-factors in bipartite graphs, Toughness condition for a graph to be all fractional (g,f,n)-critical deleted, On the complexity of recognizing tough graphs, Some results on path-factor critical avoidable graphs, TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS, Extending matchings in graphs: A survey
Cites Work
