Gallai's conjecture for outerplanar graphs

Autor:	Dequan Li, Xianya Geng, Minglei Fang
Rok vydání:	2015
Předmět:	Discrete mathematics Mathematics::Combinatorics Simple graph Conjecture Applied Mathematics Computer Science::Computational Geometry Collatz conjecture Combinatorics Computer Science::Discrete Mathematics Outerplanar graph Path (graph theory) Graph factorization Analysis Mathematics
Zdroj:	Journal of Interdisciplinary Mathematics. 18:593-598
ISSN:	2169-012X 0972-0502
DOI:	10.1080/09720502.2014.1001570
Popis:	Let G be a connected simple graph on n vertices. The Gallai's conjecture asserts that the edges of G can be decomposed into paths. In this paper, we show that the conjecture is true if G is a maximal outerplanar graph or G ia a 2-connected outerplanar graph.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::0276ec76d23c52705386449db531aed6 https://doi.org/10.1080/09720502.2014.1001570 Zobrazit plný text záznamu