The packing coloring problem for lobsters and partner limited graphs (Q2448872): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Minimum Sum Coloring of P4-sparse graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the packing chromatic number of Cartesian products, hexagonal lattice, and trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of the packing coloring problem for trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The packing chromatic number of infinite product graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3070232 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: ON GRAPHS WITH LIMITED NUMBER OF P<sub>4</sub>-PARTNERS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4820787 / rank | |||
Normal rank | |||
Latest revision as of 11:19, 8 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The packing coloring problem for lobsters and partner limited graphs |
scientific article |
Statements
The packing coloring problem for lobsters and partner limited graphs (English)
0 references
5 May 2014
0 references
packing chromatic number
0 references
partner limited graph
0 references
lobster
0 references
caterpillar
0 references
