|
Diskretnyi Analiz i Issledovanie Operatsii, 2014, Volume 21, Issue 2, Pages 33–51
(Mi da765)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
A partition of a planar graph with girth 6 into two forests containing no path of length greater than 4
A. N. Glebovab, D. Zh. Zambalaevaa a S. L. Sobolev Institute of Mathematics, SB RAS, 4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
b Novosibirsk State University, 2 Pirogov St., 630090 Novosibirsk, Russia
Abstract:
We prove that every planar graph with girth at least 6 has a vertex partition into two forests containing no path of length greater than 4. Ill. 7, bibliogr. 9.
Keywords:
planar graph, girth, path partition.
Received: 25.12.2012 Revised: 21.11.2013
Citation:
A. N. Glebov, D. Zh. Zambalaeva, “A partition of a planar graph with girth 6 into two forests containing no path of length greater than 4”, Diskretn. Anal. Issled. Oper., 21:2 (2014), 33–51; J. Appl. Industr. Math., 8:3 (2014), 317–328
Linking options:
https://www.mathnet.ru/eng/da765 https://www.mathnet.ru/eng/da/v21/i2/p33
|
Statistics & downloads: |
Abstract page: | 244 | Full-text PDF : | 61 | References: | 35 | First page: | 17 |
|