Pages that link to "Item:Q5377229"
From MaRDI portal
The following pages link to Packing coloring of generalized Sierpinski graphs (Q5377229):
Displaying 11 items.
- \(S\)-packing colorings of cubic graphs (Q294536) (← links)
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results (Q1015318) (← 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)
- Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph (Q2401415) (← links)
- The packing coloring problem for lobsters and partner limited graphs (Q2448872) (← links)
- Independence number and packing coloring of generalized Mycielski graphs (Q2656330) (← links)
- On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs (Q2662888) (← links)
- Packing chromatic numbers of finite super subdivisions of graphs (Q5081175) (← links)
- The Sierpiński domination number (Q6617234) (← links)