@article{dmtcs:2147,
    title      = {Planar graphs with $\Delta \geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable},
    author     = {Marthe Bonamy and Benjamin Lévêque and Alexandre Pinlou},
    url        = {https://dmtcs.episciences.org/2147},
    doi        = {10.46298/dmtcs.2147},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {Vol. 17 no. 3},
    issuetitle = {Graph Theory},
    eid        = 4,
    year       = {2016},
    month      = {May},
    keywords   = {Discharging, planar graphs, Edge coloring, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]},
    language   = {English},
}