Diameter in path graphs.
Belan, A., Jurica, P. (1999)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Belan, A., Jurica, P. (1999)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Fleischner, Herbert, Molina, Robert R., Smith, Ken W., West, Douglas B. (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fujita, Shinya, Halperin, Alexander, Magnant, Colton (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Stacho, L. (1995)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Elena Wisztová (1980)
Časopis pro pěstování matematiky
Similarity:
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...
Auger, David (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bullock, Frank, Dankelmann, Peter, Frick, Marietjie, Henning, Michael A., Oellermann, Ortrud R., van Aardt, Susan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Pavol Híc (1986)
Mathematica Slovaca
Similarity:
Wong, Pak-Ken (1998)
International Journal of Mathematics and Mathematical Sciences
Similarity: