Disjoint list-colorings for planar graphs

Type: Preprint

Publication Date: 2023-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.2312.17233

Locations

  • arXiv (Cornell University) - View - PDF
  • DataCite API - View

Similar Works

Action Title Year Authors
+ List Multicoloring of Planar Graphs and Related Classes 2022 Glenn G. Chappell
+ Packing list-colourings. 2021 Stijn Cambie
Wouter Cames van Batenburg
Ewan Davies
Ross J. Kang
+ Packing list-colourings 2021 Stijn Cambie
Wouter Cames van Batenburg
Ewan Davies
Ross J. Kang
+ List-Coloring Packing and Correspondence-Coloring Packing of Planar Graphs 2024 Daniel W. Cranston
Evelyne Smith‐Roberge
+ Choosability with union separation 2015 Mohit Kumbhat
Kevin Moss
Derrick Stolee
+ Choosability with union separation 2015 Mohit Kumbhat
Kevin Moss
Derrick Stolee
+ Choosability of planar graphs 1996 Margit Voigt
+ Counting Packings of List-colorings of Graphs 2024 Hemanshu Kaul
Jeffrey A. Mudrock
+ PDF Chat Fractional list packing for layered graphs 2024 Stijn Cambie
Wouter Cames van Batenburg
+ On the complexity of list $\mathcal H$-packing for sparse graph classes 2023 Tatsuya Gima
Tesshu Hanaka
Yasuaki Kobayashi
Yota Otachi
Tomohito Shirai
Akira Suzuki
Yuma Tamura
Xiao Zhou
+ Flexibility of planar graphs—Sharpening the tools to get lists of size four 2021 Ilkyoo Choi
Felix Christian Clemen
Michael Ferrara
Paul Horn
Fuhong Ma
Tomáš Masařík
+ Choosability with separation of complete graphs and minimal abundant packings 2013 Zoltán Füredi
Alexandr Kostochka
Mohit Kumbhat
+ PDF Chat Flexible List Colorings in Graphs with Special Degeneracy Conditions 2020 Peter Bradshaw
Tomáš Masařík
Ladislav Stacho
+ PDF Chat Flexible List Colorings in Graphs with Special Degeneracy Conditions 2020 Peter Bradshaw
Tomáš Masařík
Ladislav Stacho
+ Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs 2015 Konrad K. Dabrowski
François Dross
Matthew Johnson
Daniël Paulusma
+ Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs 2015 Konrad K. Dabrowski
François Dross
Matthew Johnson
Daniël Paulusma
+ On the choosability with separation of planar graphs and its correspondence colouring analogue 2022 Evelyne Smith‐Roberge
+ Flexibility of Planar Graphs -- Sharpening the Tools to Get Lists of Size Four 2020 Ilkyoo Choi
Felix Christian Clemen
Michael Ferrara
Paul Horn
Fuhong Ma
Tomáš Masařík
+ A Short Proof that the List Packing Number of any Graph is Well Defined 2022 Jeffrey A. Mudrock
+ Choosability with separation of complete graphs and minimal abundant packings 2013 Zoltán Füredi
Alexandr Kostochka
Mohit Kumbhat

Works That Cite This (0)

Action Title Year Authors

Works Cited by This (0)

Action Title Year Authors