Packing chromatic numbers of finite super subdivisions of graphs

DOI10.2298/FIL2010275LMaRDI QIDQ5081175zbMATH OpenOpenAlexFDO

Authors Rachid Lemdani, Moncef Abbas, Jasmina Ferme

Publication date 13 June 2022

Published in Filomat (Search for Journal in Brave)

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

zbMATH Keywords

finite super subdivisionneighborhood coronapacking chromatic numberpacking coloring

Mathematics Subject Classification ID

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

Abstract: The extit{packing chromatic number} of a graph $G$, denoted by $\mathrm{\%}ch{i}_{h}o(G)$, is the smallest integer $k$ such that the vertex set of $G$ can be partitioned into sets $V_i$, $iin1,ldots,k$, where each $V_i$ is an $i$-packing. In this paper, we present some general properties of packing chromatic numbers of extit{finite super subdivisions} of graphs. We determine the packing chromatic numbers of the finite super subdivisions of complete graphs, cycles and extit{neighborhood corona graphs} of a cycle and a path respectively of a complete graph and a path.

Cites work

• (d, n)-packing colorings of infinite lattices
• \(S\)-packing colorings of cubic graphs
• An infinite family of subcubic graphs with unbounded packing chromatic number
• Broadcast chromatic numbers of graphs
• Complexity of the packing coloring problem for trees
• scientific article; zbMATH DE number 5984024 (Why is no real title available?)
• Notes on complexity of packing coloring
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• On the packing chromatic number of some lattices
• On the packing chromatic number of square and hexagonal lattice
• On the packing chromatic number of subcubic outerplanar graphs
• Packing chromatic number of cubic graphs
• Packing chromatic number of subdivisions of cubic graphs
• Packing chromatic number under local changes in a graph
• Packing chromatic number versus chromatic and clique number
• Packing chromatic number, (1, 1, 2, 2)-colorings, and characterizing the Petersen graph
• Packing chromatic vertex-critical graphs
• Packing coloring of generalized Sierpinski graphs
• Packing coloring of Sierpiński-type graphs
• Packing colouring of some classes of cubic graphs
• The packing chromatic number of infinite product graphs
• The packing chromatic number of the infinite square lattice is between 13 and 15
• The packing coloring of distance graphs \(D(k,t)\)
• The spectrum of neighborhood corona of graphs

Cited in

(2)

• Packing chromatic number of windmill related graphs and chain silicate networks
• Distance dominator packing coloring of type II

This page was built for publication: Packing chromatic numbers of finite super subdivisions of graphs

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