On degree sequences of graphs with given cyclomatic number.
Schocker, Manfred (2001)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Displaying similar documents to “A new class of enumeration problems”
On degree sequences of graphs with given cyclomatic number.
A generalization of a theorem of Turán for valuated graphs
Jaroslav Morávek (1974)
Časopis pro pěstování matematiky
Similarity:
On the number of forests
Frank Harary, Edgar M. Palmer (1969)
Matematický časopis
Similarity:
The point-outerthickness of complete -partite graphs
John Mitchem (1974)
Compositio Mathematica
Similarity:
A Survey of the Path Partition Conjecture
Marietjie Frick (2013)
Discussiones Mathematicae Graph Theory
Similarity:
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.