Degree powers in graphs with a forbidden even cycle.
Nikiforov, Vladimir (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Diameter in path graphs.”
Degree powers in graphs with a forbidden even cycle.
On the graphs with maximum distance or -diameter
Wayne Goddard, Christine S. Swart, Henda C. Swart (2005)
Mathematica Slovaca
Similarity:
Connectivity of path graphs.
Ferrero, D. (2003)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
The Path-Distance-Width of Hypercubes
Yota Otachi (2013)
Discussiones Mathematicae Graph Theory
Similarity:
The path-distance-width of a connected graph G is the minimum integer w satisfying that there is a nonempty subset of S ⊆ V (G) such that the number of the vertices with distance i from S is at most w for any nonnegative integer i. In this note, we determine the path-distance-width of hypercubes.
On extremal graphs with no long paths.
Ali, Asad Ali, Staton, William (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Long path lemma concerning connectivity and independence number.
Fujita, Shinya, Halperin, Alexander, Magnant, Colton (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Induced paths in twin-free graphs.
Auger, David (2008)
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...
Domination, packing and excluded minors.
Böhme, Thomas, Mohar, Bojan (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On a generalization of Meyniel's conjecture on the Cops and Robbers game.
Alon, Noga, Mehrabian, Abbas (2011)
The Electronic Journal of Combinatorics [electronic only]
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:
Independence number and disjoint theta graphs.
Fujita, Shinya, Magnant, Colton (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: