Author:
Martin Barnaby,Raimondi Franco,Chen Taolue,Martin Jos
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference23 articles.
1. On the packing chromatic number of Cartesian products, hexagonal lattice, and trees;Brešar;Discrete Appl. Math.,2007
2. Packing chromatic number, (1, 1, 2, 2)-colorings, and characterizing the Petersen graph;Brešar;Aequationes Math.,2017
3. Satisfiability and computing van der Waerden numbers;Dransfield;Electron. J. Combin.,2004
4. J. Ekstein, J. Fiala, P. Holub, B. Lidický, The packing chromatic number of the square lattice is at least 12, 2011. CoRR https://arxiv.org/abs/1003.2291
5. Complexity of the packing coloring problem for trees;Fiala;Discrete Appl. Math.,2010
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献