Induced paths in twin-free graphs.
Auger, David (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Structural properties of twin-free graphs.”
Induced paths in twin-free graphs.
Distance in graphs
Roger C. Entringer, Douglas E. Jackson, D. A. Snyder (1976)
Czechoslovak Mathematical Journal
Similarity:
Rainbow Vertex-Connection and Forbidden Subgraphs
Wenjing Li, Xueliang Li, Jingshu Zhang (2018)
Discussiones Mathematicae Graph Theory
Similarity:
A path in a vertex-colored graph is called vertex-rainbow if its internal vertices have pairwise distinct colors. A vertex-colored graph G is rainbow vertex-connected if for any two distinct vertices of G, there is a vertex-rainbow path connecting them. For a connected graph G, the rainbow vertex-connection number of G, denoted by rvc(G), is defined as the minimum number of colors that are required to make G rainbow vertex-connected. In this paper, we find all the families ℱ of connected...
Recognizing the -structure of claw-free graphs and a larger graph class.
Babel, Luitpold, Brandstädt, Andreas, Le, Van Bang (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Distance domination and distance irredundance in graphs.
Hansberg, Adriana, Meierling, Dirk, Volkmann, Lutz (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on -free precolouring with colours.
Rackham, Tom (2009)
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 characterization of graphs in which some minimum dominating set covers all the edges
Bert L. Hartnell, Douglas F. Rall (1995)
Czechoslovak Mathematical Journal
Similarity:
Elongation in a graph
Bohdan Zelinka (1982)
Mathematica Slovaca
Similarity: