Defective Coloring on Classes of Perfect Graphs
From MaRDI portal
Publication:5864723
DOI10.46298/dmtcs.4926zbMath1497.05066OpenAlexW4207053563MaRDI QIDQ5864723
Michael Lampis, Valia Mitsou, Rémy Belmonte
Publication date: 8 June 2022
Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.46298/dmtcs.4926
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On 1-improper 2-coloring of sparse graphs
- Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
- On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number
- Bounds and fixed-parameter algorithms for weighted improper coloring
- Trivially perfect graphs
- A partial k-arboretum of graphs with bounded treewidth
- Extremal results on defective colorings of graphs
- Which problems have strongly exponential complexity?
- Quasi-threshold graphs
- Weighted improper colouring
- Directed weighted improper coloring for cellular channel allocation
- Vertex coloring edge-weighted digraphs
- Improper colouring of (random) unit disk graphs
- On a property of the class of n-colorable graphs
- Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions
- Improper coloring of unit disk graphs
- IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS
- Defective coloring revisited
- Fractional, Circular, and Defective Coloring of Series-Parallel Graphs
- The t-Improper Chromatic Number of Random Graphs
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Graph minors. II. Algorithmic aspects of tree-width
- A note on defective colorings of graphs in surfaces
- Graph Classes: A Survey
- Improper choosability of graphs and maximum average degree
- Parameterized Algorithms
This page was built for publication: Defective Coloring on Classes of Perfect Graphs