Pages that link to "Item:Q528575"

The following pages link to The packing chromatic number of the infinite square lattice is between 13 and 15 (Q528575):

Displayed 16 items.

• Packing coloring of Sierpiński-type graphs (Q1621491) ‎ (← links)
• An infinite family of subcubic graphs with unbounded packing chromatic number (Q1637153) ‎ (← links)
• Notes on complexity of packing coloring (Q1641149) ‎ (← links)
• Packing chromatic number versus chromatic and clique number (Q1647755) ‎ (← links)
• \((d, n)\)-packing colorings of infinite lattices (Q1701099) ‎ (← links)
• On the packing chromatic number of subcubic outerplanar graphs (Q1727741) ‎ (← links)
• A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices (Q1730261) ‎ (← links)
• \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\) (Q2028095) ‎ (← links)
• Graphs that are critical for the packing chromatic number (Q2118245) ‎ (← links)
• A survey on packing colorings (Q2194523) ‎ (← links)
• \(S\)-packing chromatic vertex-critical graphs (Q2197411) ‎ (← links)
• Packing colorings of subcubic outerplanar graphs (Q2198310) ‎ (← links)
• On the packing chromatic number of Moore graphs (Q2217471) ‎ (← links)
• Independence number and packing coloring of generalized Mycielski graphs (Q2656330) ‎ (← links)
• A GENERAL POSITION PROBLEM IN GRAPH THEORY (Q4684254) ‎ (← links)
• Packing chromatic numbers of finite super subdivisions of graphs (Q5081175) ‎ (← links)