Packing coloring of some undirected and oriented coronae graphs

DOI10.7151/dmgt.1963zbMath1366.05044arXiv1506.07248OpenAlexW2963304639MaRDI QIDQ2364089

Daouya Laïche, Isma Bouchemakh, Eric Sopena

Publication date: 17 July 2017

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.07248

zbMATH Keywords

cyclepathpacking chromatic numberpacking coloringcorona graph

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Packing chromatic number of cubic graphs ⋮ Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs ⋮ A survey on packing colorings ⋮ \(S\)-packing coloring of cubic Halin graphs ⋮ On packing \(S\)-colorings of subcubic graphs ⋮ About \(S\)-packing coloring of subcubic graphs ⋮ Packing chromatic number of subdivisions of cubic graphs ⋮ Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs ⋮ Neighbor sum distinguishing total colorings of corona of subcubic graphs ⋮ Packing colouring of some classes of cubic graphs ⋮ Graphs that are critical for the packing chromatic number

Cites Work

• Unnamed Item
• Unnamed Item
• Packing chromatic number of distance graphs
• On the packing chromatic number of some lattices
• The packing chromatic number of infinite product graphs
• The packing chromatic number of hypercubes
• A note on packing chromatic number of the square lattice
• Dichotomies properties on computational complexity of \(S\)-packing coloring problems
• The packing coloring of distance graphs \(D(k,t)\)
• On packing colorings of distance graphs
• The packing coloring problem for lobsters and partner limited graphs
• Polynomial instances of the Packing Coloring Problem
• The Packing Coloring Problem for (q,q-4) Graphs
• On the packing chromatic number of square and hexagonal lattice
• On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs
• Complexity of the Packing Coloring Problem for Trees
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

This page was built for publication: Packing coloring of some undirected and oriented coronae graphs