Dynamic F-free coloring of graphs

DOI10.1007/S00373-018-1886-8MaRDI QIDQ1637099zbMATH OpenOpenAlexWikidataFDO

Authors Piotr Borowiecki, Elżbieta Sidorowicz

Publication date 7 June 2018

Published in Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00373-018-1886-8

zbMATH Keywords

graph coloringgreedy algorithmGrundy numberimproper coloringsubcoloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 3912409
• On-line coloring of \(I_{s}\)-free graphs
• Dynamic coloring of graphs
• Dynamic graph coloring
• Improved dynamic graph coloring

Cites work

• P₄-colorings and P₄-bipartite graphs
• Chromatic graph theory
• Computational aspects of greedy partitioning of graphs
• Constructions of k-critical P₅-free graphs
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Dynamic coloring of graphs
• Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
• Graph colouring and the probabilistic method
• Graph Subcolorings: Complexity and Algorithms
• scientific article; zbMATH DE number 3912409 (Why is no real title available?)
• scientific article; zbMATH DE number 3800939 (Why is no real title available?)
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• scientific article; zbMATH DE number 3276423 (Why is no real title available?)
• Improper coloring of unit disk graphs
• Improper coloring of weighted grid and hexagonal graphs
• Iterative coloring extension of a maximum clique
• Networks. An introduction.
• New potential functions for greedy independence and coloring
• Obstructions for three-coloring graphs with one forbidden induced subgraph
• On the Grundy number of graphs with few P₄'s
• Partitions of graphs into cographs
• Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult
• Results on the Grundy chromatic number of graphs
• Some perfect coloring properties of graphs
• Subcolorings and the subchromatic number of a graph
• The complexity of \(G\)-free colourability
• The subchromatic number of a graph

Cited in

(4)

• 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs
• scientific article; zbMATH DE number 6383853 (Why is no real title available?)
• Dynamic coloring on restricted graph classes
• Hypergraph operations preserving sc-greediness

Describes a project that uses

Uses Software

• CriticalPfreeGraphs

This page was built for publication: Dynamic \(F\)-free coloring of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1637099)