Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: rooted path graphs

Sortuj według:

Ogranicz wyniki do:

Asteroidal Quadruples in non Rooted Path Graphs

100%

Gutierrez M., Lévêque B., Tondato S. B.

Discussiones Mathematicae Graph Theory

2015

tom 35

nr 4

603-614

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 paper directed path graphs that are non rooted path graphs. We prove that such graphs always contain an asteroidal quadruple.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Gutierrez M.

1 Lévêque B.

1 Tondato S. B.

1 2015

Wyniki wyszukiwania

Asteroidal Quadruples in non Rooted Path Graphs