A Property Of The Number Of Perfect Matchings Of A Graph
A ramsey-type theorem for multiple disjoint copies of induced subgraphs
Let k and ℓ be positive integers with ℓ ≤ k − 2. It is proved that there exists a positive integer c depending on k and ℓ such that every graph of order (2k−1−ℓ/k)n+c contains n vertex disjoint induced subgraphs, where these subgraphs are isomorphic to each other and they are isomorphic to one of four graphs: (1) a clique of order k, (2) an independent set of order k, (3) the join of a clique of order ℓ and an independent set of order k − ℓ, or (4) the union of an independent set of order ℓ and...
A remark about fractional -critical graphs.
A result on -critical graphs.
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.