The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Degree powers in graphs with a forbidden even cycle.”

Diameter in path graphs.

Belan, A., Jurica, P. (1999)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

A proof of the two-path conjecture.

Fleischner, Herbert, Molina, Robert R., Smith, Ken W., West, Douglas B. (2002)

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...

Hamiltonicity of k -traceable graphs.

Bullock, Frank, Dankelmann, Peter, Frick, Marietjie, Henning, Michael A., Oellermann, Ortrud R., van Aardt, Susan (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity: