Skip to content
DraconiticResearch
Search Sources API
194,067 studies31 sourcesUpdated 9 min ago
Peer-reviewedLicence not statedDiscrete Mathematics

Bounds for B-coloring planar and outerplanar graphs

  • Ryan Martin
  • Miklós Ruszinkó
  • Gábor Sárközy
Open at sourceDOICite

Versions

Related

  1. Total-coloring of planar graphs with maximum degree 6 and without prescribed 4-cycles
    Enqiang Zhu, Yangyang Zhou, Jin Xu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  2. The Borowiecki-Broere Generalized Total Coloring Conjecture for Planar Graphs
    James Alexander Schreib
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. Frugal coloring in planar graphs with maximum degree 4 and 5
    Boštjan Brešar, Přemysl Holub, Marko Jakovac +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. List coloring C3-free planar graphs with a sparse matching of restricted lists
    Stephen G. Hartke, Yupei Li, Joseph Pappe +3
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. B-coloring of K2,t-free planar graphs
    Zhengxu Jiang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@article{martin2026bounds,
  title = {{Bounds for B-coloring planar and outerplanar graphs}},
  author = {Ryan Martin and Miklós Ruszinkó and Gábor Sárközy},
  journal = {Discrete Mathematics},
  year = {2026},
  month = sep,
  doi = {10.1016/j.disc.2026.115426},
  url = {https://hal.science/hal-05749860v1},
}
RIS
TY  - JOUR
TI  - Bounds for B-coloring planar and outerplanar graphs
AU  - Ryan Martin
AU  - Miklós Ruszinkó
AU  - Gábor Sárközy
PY  - 2026
DA  - 2026/09/15
JO  - Discrete Mathematics
DO  - 10.1016/j.disc.2026.115426
UR  - https://hal.science/hal-05749860v1
SN  - 0012-365X
ER  -