An asymptotic result for the path partition conjecture.
Frick, Marietjie, Schiermeyer, Ingo (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “A path(ological) partition problem”
An asymptotic result for the path partition conjecture.
Elongation in a graph
Bohdan Zelinka (1982)
Mathematica Slovaca
Similarity:
On domatic numbers of graphs
Bohdan Zelinka (1981)
Mathematica Slovaca
Similarity:
Vertex degree sequences of graphs with small number of circuits.
Gutman, Ivan (1989)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Some remarks on domatic numbers of graphs
Bohdan Zelinka (1981)
Časopis pro pěstování matematiky
Similarity:
Degree powers in graphs with a forbidden even cycle.
Nikiforov, Vladimir (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Heavy subgraph pairs for traceability of block-chains
Binlong Li, Hajo Broersma, Shenggui Zhang (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called traceable if it contains a Hamilton path, i.e., a path containing all its vertices. Let G be a graph on n vertices. We say that an induced subgraph of G is o−1-heavy if it contains two nonadjacent vertices which satisfy an Ore-type degree condition for traceability, i.e., with degree sum at least n−1 in G. A block-chain is a graph whose block graph is a path, i.e., it is either a P1, P2, or a 2-connected graph, or a graph with at least one cut vertex and exactly two...