Induced paths in twin-free graphs.
Auger, David (2008)
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.
Displaying similar documents to “Heavy subgraph pairs for traceability of block-chains”
Induced paths in twin-free graphs.
Elongation in a graph
Bohdan Zelinka (1982)
Mathematica Slovaca
Similarity:
Hamiltonicity of -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:
On the graphs with maximum distance or -diameter
Wayne Goddard, Christine S. Swart, Henda C. Swart (2005)
Mathematica Slovaca
Similarity:
A new upper bound on the total domination number of a graph.
Henning, Michael A., Yeo, Anders (2007)
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: