Grundy number on -classes

DOI10.1016/j.endm.2009.11.005zbMath1268.05168OpenAlexW1482933776MaRDI QIDQ2840510

Cláudia Linhares Sales, Julio Araujo

Publication date: 19 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00531691/file/grundy_p4-final.pdf

zbMATH Keywords

graph theorymodular decompositionGrundy number\(P_{4}\)-classesfat-extended \(P_{4}\)-laden graphs

Mathematics Subject Classification ID

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

Related Items (2)

Maximization coloring problems on graphs with few \(P_4\) ⋮ Restricted coloring problems on graphs with few

Cites Work

• Unnamed Item
• Unnamed Item
• \(P_{4}\)-laden graphs: A new class of brittle 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: Grundy number on -classes