Optimal unavoidable sets of types of 3-paths for planar graphs of given girth

Stanislav Jendrol'; Mária Maceková; Mickaël Montassier; Roman Soták

doi:10.1016/j.disc.2015.10.016

Journal Articles Discrete Mathematics Year : 2016

Optimal unavoidable sets of types of 3-paths for planar graphs of given girth

(1) , (1) , (2) , (1)

1
2

Stanislav Jendrol'

Function : Author
PersonId : 912729

Institute of Mathematics [Kosice, Slovakia]

Mária Maceková

Function : Author

Institute of Mathematics [Kosice, Slovakia]

Mickaël Montassier

Function : Author
PersonId : 7097
IdHAL : mickael-montassier
IdRef : 105605115

Algorithmes, Graphes et Combinatoire

CV

Roman Soták

Function : Author

Institute of Mathematics [Kosice, Slovakia]

Keywords

3-path Optimal unavoidable set Girth Planar graph

Domains

Discrete Mathematics [cs.DM]

Mickael Montassier : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01263824

Submitted on : Thursday, January 28, 2016-11:53:34 AM

Last modification on : Friday, March 24, 2023-2:53:01 PM

Dates and versions

lirmm-01263824 , version 1 (28-01-2016)

Identifiers

HAL Id : lirmm-01263824 , version 1
DOI : 10.1016/j.disc.2015.10.016

Cite

Stanislav Jendrol', Mária Maceková, Mickaël Montassier, Roman Soták. Optimal unavoidable sets of types of 3-paths for planar graphs of given girth. Discrete Mathematics, 2016, 339 (2), pp.780 - 789. ⟨10.1016/j.disc.2015.10.016⟩. ⟨lirmm-01263824⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS ALGCO LIRMM TDS-MACS MIPS UNIV-MONTPELLIER

87 View

0 Download

Optimal unavoidable sets of types of 3-paths for planar graphs of given girth

Keywords

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share