The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Martin Trinks (2014)
Discussiones Mathematicae Graph Theory
Similarity:
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
Gleiss, Petra M., Leydold, Josef, Stadler, Peter F. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jordon, Heather (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Janez Žerovnik (2006)
Mathematica Slovaca
Similarity:
John L. Simons (2008)
Acta Arithmetica
Similarity:
Smith, Benjamin R. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Al-Rhayyel, A.A. (1996)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Mohar, Bojan, Škrekovski, Riste (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hong Wang (2012)
Discussiones Mathematicae Graph Theory
Similarity:
We prove that if G is a graph of order 5k and the minimum degree of G is at least 3k then G contains k disjoint cycles of length 5.