On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs.

Whitney’s Broken-cycle Theorem states the chromatic polynomial of a graph as a sum over special edge subsets. We give a definition of cycles in hypergraphs that preserves the statement of the theorem there

Mathematical Models and a Constructive Heuristic for Finding Minimum Fundamental Cycle Bases

Leo Liberti, Edoardo Amaldi, Francesco Maffioli, Nelson Maculan (2005)

The Yugoslav Journal of Operations Research

Similarity:

On the basis of the direct product of paths and wheels.

Al-Rhayyel, A.A. (1996)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Interchangeability of relevant cycles in graphs.

Gleiss, Petra M., Leydold, Josef, Stadler, Peter F. (2000)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On bicritical snarks

Eckhard Steffen (2001)

Mathematica Slovaca

Similarity:

Displaying similar documents to “On the number of perfect matchings and Hamilton cycles in ε -regular non-bipartite graphs.”

Displaying similar documents to “On the number of perfect matchings and Hamilton cycles in $ε$ -regular non-bipartite graphs.”