On the Grundy number of graphs with few <mml:math altimg="si10.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>’s-Reference-Cited by-同舟云学术

On the Grundy number of graphs with few P4’s

Published:2012-12 Issue:18 Volume:160 Page:2514-2522
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Araujo J.,Linhares Sales C.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference18 articles.

1. J. Araujo, C. Linhares Sales, I. Sau, Weighted coloring on p4-sparse graphs, in: 11es Journées Doctorales en Informatique et Réseaux, Sophia Antipolis, France, 2010.

2. M. Asté, F. Havet, C. Linhares Sales, Grundy number and lexicographic product of graphs, in: Proceedings of International Conference on Relations, Orders and Graphs and their Interaction with Computer Science, ROGICS 2008, 2008.

3. Four classes of perfectly orderable graphs;Chvátal;Journal of Graph Theory,1987

4. S. Foldes, P.L. Hammer, Split graphs, in: Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing, Louisiana State Univ., Baton Rouge, La., 1977, Utilitas Math., Winnipeg, Man., Congressus Numerantium, No. XIX, 1977, pp. 311–315.

5. p4-laden graphs: a new class of brittle graphs;Giakoumakis;Information Processing Letters,1996

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Grundy Distinguishes Treewidth from Pathwidth;SIAM Journal on Discrete Mathematics;2022-07-28

2. Grundy dominating sequences on X-join product;Discrete Applied Mathematics;2020-09

3. PSPACE-completeness of two graph coloring games;Theoretical Computer Science;2020-07

4. PSPACE-hardness of Two Graph Coloring Games;Electronic Notes in Theoretical Computer Science;2019-08

5. Complexity of Grundy coloring and its variants;Discrete Applied Mathematics;2018-07