A lower bound on the order of the largest induced linear forest in triangle-free planar graphs

François Dross; Mickaël Montassier; Alexandre Pinlou

doi:10.1016/j.disc.2018.11.023

Journal Articles Discrete Mathematics Year : 2019

A lower bound on the order of the largest induced linear forest in triangle-free planar graphs

(1) , (1) , (1)

1

François Dross

Function : Author
PersonId : 9100
IdHAL : francois-dross

Algorithmes, Graphes et Combinatoire

Mickaël Montassier

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

Algorithmes, Graphes et Combinatoire

CV

Alexandre Pinlou

Function : Author
PersonId : 6031
IdHAL : alexandre-pinlou
ORCID : 0000-0002-3116-3019
IdRef : 112452698

Algorithmes, Graphes et Combinatoire

CV

Domains

Logic [math.LO]

Fichier principal

dmp17b.pdf (256.8 Ko)

Isabelle Gouat : Connect in order to contact the contributor

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

Submitted on : Thursday, February 7, 2019-2:20:45 PM

Last modification on : Tuesday, June 20, 2023-5:44:01 PM

Long-term archiving on: Wednesday, May 8, 2019-3:56:09 PM

Dates and versions

lirmm-02010775 , version 1 (07-02-2019)

Identifiers

HAL Id : lirmm-02010775 , version 1
ARXIV : 1705.11133
DOI : 10.1016/j.disc.2018.11.023

Cite

François Dross, Mickaël Montassier, Alexandre Pinlou. A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. Discrete Mathematics, 2019, 342 (4), pp.943-950. ⟨10.1016/j.disc.2018.11.023⟩. ⟨lirmm-02010775⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS INSMI ALGCO LIRMM MIPS UNIV-MONTPELLIER ANR

85 View

99 Download

A lower bound on the order of the largest induced linear forest in triangle-free planar graphs

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share