Structural properties of twin-free graphs.
Charon, Iréne, Honkala, Iiro, Hudry, Olivier, Lobstein, Antoine (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Charon, Iréne, Honkala, Iiro, Hudry, Olivier, Lobstein, Antoine (2007)
The Electronic Journal of Combinatorics [electronic only]
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...
Wayne Goddard, Christine S. Swart, Henda C. Swart (2005)
Mathematica Slovaca
Similarity:
Bohdan Zelinka (1982)
Mathematica Slovaca
Similarity:
Alon, Noga, Mehrabian, Abbas (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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.
Henning, Michael A., Yeo, Anders (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Böhme, Thomas, Mohar, Bojan (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity: