The existence of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-factors in squares of graphs

Page 1

	Year	Citations
Tough graphs and hamiltonian circuits Vašek Chvátal Discrete Mathematics Graph TheoryAlgebraic Graph TheoryStructural Graph TheoryEducationNetwork Analysis	1973	607
Non-separable and planar graphs Hassler Whitney Transactions of the American Mathematical Society Separable GraphGraph MinorGeometric Graph TheoryGraph TheoryAlgebraic Graph Theory	1932	502
The Factors of Graphs W. T. Tutte Canadian Journal of Mathematics More EdgesDirected GraphNetwork ScienceGraph TheoryGeometric Graph Theory	1952	293
Toughness and the existence of <i>k</i>‐factors Hikoe Enomoto, Bill Jackson, P. Katerinis, Journal of Graph Theory Network ScienceGraph TheoryForm Factor (Design)K ‐FactorStructural Graph Theory	1985	154
Toughness of graphs and the existence of factors P. Katerinis Discrete Mathematics EngineeringGraph TheoryAlgebraic Graph TheoryStructural Graph TheoryExtremal Graph Theory	1990	37
Some Hamiltonian results in powers of graphs Arthur M. Hobbs Journal of Research of the National Bureau of Standards Section B Mathematical Sciences	1973	15

Page 1