Dynamic \(F\)-free coloring of graphs
From MaRDI portal
Publication:1637099
DOI10.1007/s00373-018-1886-8zbMath1397.05059OpenAlexW2793449571WikidataQ62043599 ScholiaQ62043599MaRDI QIDQ1637099
Piotr Borowiecki, Elżbieta Sidorowicz
Publication date: 7 June 2018
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-018-1886-8
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitions of graphs into cographs
- Results on the Grundy chromatic number of graphs
- Some perfect coloring properties of graphs
- The complexity of \(G\)-free colourability
- Subcolorings and the subchromatic number of a graph
- Computational aspects of greedy partitioning of graphs
- On the Grundy number of graphs with few \(P_4\)'s
- The subchromatic number of a graph
- New potential functions for greedy independence and coloring
- Constructions of \(k\)-critical \(P_5\)-free graphs
- Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult
- Improper coloring of unit disk graphs
- IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Graph Subcolorings: Complexity and Algorithms
- Iterative coloring extension of a maximum clique
- Obstructions for three-coloring graphs with one forbidden induced subgraph
- Networks
- Graph colouring and the probabilistic method
This page was built for publication: Dynamic \(F\)-free coloring of graphs
