Pages that link to "Item:Q509625"

The following pages link to Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph (Q509625):

Displayed 20 items.

• The packing chromatic number of the infinite square lattice is between 13 and 15 (Q528575) ‎ (← links)
• Packing coloring of Sierpiński-type graphs (Q1621491) ‎ (← links)
• An infinite family of subcubic graphs with unbounded packing chromatic number (Q1637153) ‎ (← links)
• Packing chromatic number versus chromatic and clique number (Q1647755) ‎ (← links)
• Packing chromatic number of cubic graphs (Q1686001) ‎ (← links)
• On the packing chromatic number of subcubic outerplanar graphs (Q1727741) ‎ (← links)
• Facial packing vertex-coloring of subdivided plane graphs (Q1730225) ‎ (← links)
• Packing chromatic number of subdivisions of cubic graphs (Q1741592) ‎ (← links)
• \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\) (Q2028095) ‎ (← links)
• Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs (Q2043348) ‎ (← links)
• Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs (Q2192116) ‎ (← links)
• A survey on packing colorings (Q2194523) ‎ (← links)
• \(S\)-packing chromatic vertex-critical graphs (Q2197411) ‎ (← links)
• Packing colorings of subcubic outerplanar graphs (Q2198310) ‎ (← links)
• Independence number and packing coloring of generalized Mycielski graphs (Q2656330) ‎ (← links)
• On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\) (Q2698203) ‎ (← links)
• Packing colouring of some classes of cubic graphs (Q4622625) ‎ (← links)
• A GENERAL POSITION PROBLEM IN GRAPH THEORY (Q4684254) ‎ (← links)
• Packing chromatic numbers of finite super subdivisions of graphs (Q5081175) ‎ (← links)
• On packing \(S\)-colorings of subcubic graphs (Q6157413) ‎ (← links)