Transversals of circuits in the lexicographic product of directed graphs
Carsten Thomassen (1975)
Mathématiques et Sciences Humaines
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On partial cubes and graphs with convex intervals”
Transversals of circuits in the lexicographic product of directed graphs
Uniqueness of graph square roots of girth six.
Adamaszek, Anna, Adamaszek, Michał (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Randomly graphs
Gary Chartrand, Ortrud R. Oellermann, Sergio Ruiz (1986)
Mathematica Slovaca
Similarity:
Old and new generalizations of line graphs.
Bagga, Jay (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Path-Neighborhood Graphs
R.C. Laskar, Henry Martyn Mulder (2013)
Discussiones Mathematicae Graph Theory
Similarity:
A path-neighborhood graph is a connected graph in which every neighborhood induces a path. In the main results the 3-sun-free path-neighborhood graphs are characterized. The 3-sun is obtained from a 6-cycle by adding three chords between the three pairs of vertices at distance 2. A Pk-graph is a path-neighborhood graph in which every neighborhood is a Pk, where Pk is the path on k vertices. The Pk-graphs are characterized for k ≤ 4.