Packing chromatic number of windmill related graphs and chain silicate networks

DOI10.1007/978-3-031-41420-6_67MaRDI QIDQ6609897zbMATHFDO

Authors Tony Augustine, Roy Santiago

Publication date 24 September 2024

zbMATH Keywords

packing coloringchain silicate networkuniform \(n\)-windmill complete graphuniform \(n\)-windmill star graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites work

• A note on packing chromatic number of the square lattice
• A note on the packing chromatic number of lexicographic products
• Broadcast chromatic numbers of graphs
• Notes on complexity of packing coloring
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• On the packing chromatic number of Moore graphs
• On the packing chromatic number of some lattices
• On the packing chromatic number of subcubic outerplanar graphs
• Packing chromatic number of base-3 Sierpiński graphs
• Packing chromatic number of certain fan and wheel related graphs
• Packing chromatic number of cubic graphs
• Packing chromatic number under local changes in a graph
• Packing chromatic numbers of finite super subdivisions of graphs
• The packing chromatic number of hypercubes
• The packing chromatic number of the infinite square lattice is between 13 and 15
• The packing coloring problem for lobsters and partner limited graphs
• \(S\)-packing colorings of cubic graphs

This page was built for publication: Packing chromatic number of windmill related graphs and chain silicate networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6609897)