Restricted Eulerian circuits in directed graphs
H. W. Berkowitz (1978)
Colloquium Mathematicae
Similarity:
Displaying similar documents to “Path systems in acyclic directed graphs”
Restricted Eulerian circuits in directed graphs
'3in1' enhanced: three squared ways to '3in1' GRAPHS
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
Similarity:
A note on intersecting graphs.
Bretto, A. (1999)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
Chord graphs - new means for representing graphs
W. Wessel (1987)
Applicationes Mathematicae
Similarity:
Asteroidal Quadruples in non Rooted Path Graphs
Marisa Gutierrez, Benjamin Lévêque, Silvia B. Tondato (2015)
Discussiones Mathematicae Graph Theory
Similarity:
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are directed path graphs. Several characterizations are known for directed path graphs: one by forbidden induced subgraphs and one by forbidden asteroids. It is an open problem to find such characterizations for rooted path graphs. For this purpose, we are studying in this...
A Generalized Direct Product Of Graphs
Risto Šokarovski (1977)
Publications de l'Institut Mathématique
Similarity:
A technique for reconstructing disconnected graphs
Gary Chartrand, Hudson V. Kronk, Seymour Schuster (1973)
Colloquium Mathematicae
Similarity:
On the domination of functions by graphs
S. F. Kapoor, Linda M. Lesniak (1976)
Colloquium Mathematicae
Similarity:
SOUR graphs for efficient completion.
Lynch, Christopher, Strogova Polina (1998)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Supermagic Generalized Double Graphs 1
Jaroslav Ivančo (2016)
Discussiones Mathematicae Graph Theory
Similarity:
A graph G is called supermagic if it admits a labelling of the edges by pairwise di erent consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we will introduce some constructions of supermagic labellings of some graphs generalizing double graphs. Inter alia we show that the double graphs of regular Hamiltonian graphs and some circulant graphs are supermagic.