Zobrazeno 1 - 2
of 2
pro vyhledávání: '"forbidden subgrap"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 34, Iss 2, Pp 287-307 (2014)
A graph is called traceable if it contains a Hamilton path, i.e., a path containing all its vertices. Let G be a graph on n vertices. We say that an induced subgraph of G is o−1-heavy if it contains two nonadjacent vertices which satisfy an Ore-typ
Externí odkaz:
https://doaj.org/article/8a2b714b768147569667b7e7e4c1a5b1
Publikováno v:
Discussiones mathematicae. Graph theory, 34(2), 287-307. University of Zielona Gora
Discussiones Mathematicae Graph Theory, Vol 34, Iss 2, Pp 287-307 (2014)
Discussiones Mathematicae Graph Theory, Vol 34, Iss 2, Pp 287-307 (2014)
A graph is called traceable if it contains a Hamilton path, i.e., a path containing all its vertices. Let G be a graph on n vertices. We say that an induced subgraph of G is o-1-heavy if it contains two nonadjacent vertices which satisfy an Ore-type
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ed44b24377947bee04177de70576bf13
https://research.utwente.nl/en/publications/33e0b299-74f1-4186-bb3c-b9117f3e24fd
https://research.utwente.nl/en/publications/33e0b299-74f1-4186-bb3c-b9117f3e24fd
