A short proof of a theorem of Kano and Yu on factors in regular graphs.
A simple proof of a theorem by Tutte.
A solvable case of the set-partitioning problem
A Sufficient Condition for a Graph to Be Hamiltonian.
A sufficient condition for graphs with 1-factors
A Survey of the Path Partition Conjecture
The Path Partition Conjecture (PPC) states that if G is any graph and (λ1, λ2) any pair of positive integers such that G has no path with more than λ1 + λ2 vertices, then there exists a partition (V1, V2) of the vertex set of G such that Vi has no path with more than λi vertices, i = 1, 2. We present a brief history of the PPC, discuss its relation to other conjectures and survey results on the PPC that have appeared in the literature since its first formulation in 1981.
A uniform approach to complexes arising from forests.
Adaptive identification in Torii in the King lattice.
Algebraic and combinatorial properties of products [Abstract of thesis]
Algebraic matching theory.
Algebraic Structure Count of Some Cyclic Hexagonal-square Chains
Algorithm engineering for optimal graph bipartization.
All regular multigraphs of even order and high degree are 1-factorable.
Alspach's problem: The case of Hamilton cycles and 5-cycles.
An entropy proof of the Kahn-Lovász theorem.
An even side analogue of Room squares.
An exact performance bound for an time greedy matching procedure.
An exploration of the permanent-determinant method.
An inequality chain of domination parameters for trees
We prove that the smallest cardinality of a maximal packing in any tree is at most the cardinality of an R-annihilated set. As a corollary to this result we point out that a set of parameters of trees involving packing, perfect neighbourhood, R-annihilated, irredundant and dominating sets is totally ordered. The class of trees for which all these parameters are equal is described and we give an example of a tree in which most of them are distinct.
Approximation algorithms for some graph partitioning problems.