On the Grundy number of graphs with few \(P_4\)'s

DOI10.1016/j.dam.2011.08.016zbMath1296.05065OpenAlexW2014098222MaRDI QIDQ1759824

Cláudia Linhares Sales, Julio Araujo

Publication date: 22 November 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.08.016

zbMATH Keywords

modular decompositionGrundy number\(P_4\)-classes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Related Items (9)

PSPACE-hardness of two graph coloring games ⋮ Dynamic \(F\)-free coloring of graphs ⋮ PSPACE-completeness of two graph coloring games ⋮ Grundy Distinguishes Treewidth from Pathwidth ⋮ Unnamed Item ⋮ Computational aspects of greedy partitioning of graphs ⋮ On Computational Aspects of Greedy Partitioning of Graphs ⋮ Complexity of Grundy coloring and its variants ⋮ Grundy dominating sequences on \(X\)-join product

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A coloring problem for weighted graphs
• Results on the Grundy chromatic number of graphs
• The splittance of a graph
• \(P_{4}\)-laden graphs: A new class of brittle graphs
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• Four classes of perfectly orderable graphs
• On-line and first fit colorings of graphs
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Reducibility among Combinatorial Problems

This page was built for publication: On the Grundy number of graphs with few \(P_4\)'s