Independence number and packing coloring of generalized Mycielski graphs

DOI10.7151/dmgt.2337zbMath1459.05230OpenAlexW3035129026MaRDI QIDQ2656330

Taoufiq Gadi, Ez Zobair Bidine, Mustapha Kchikech

Publication date: 11 March 2021

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

Full work available at URL: https://doi.org/10.7151/dmgt.2337

zbMATH Keywords

independence numberpacking chromatic numbergeneralized MycielskiansMycielskians

Mathematics Subject Classification ID

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

Related Items (2)

The exponential growth of the packing chromatic number of iterated Mycielskians ⋮ A characterization of 4-\(\chi_S\)-vertex-critical graphs for packing sequences with \(s_1 = 1\) and \(s_2 \geq 3\)

Cites Work

• Unnamed Item
• \(S\)-packing colorings of cubic graphs
• Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph
• Packing chromatic number under local changes in a graph
• The packing chromatic number of the infinite square lattice is between 13 and 15
• Complexity of the packing coloring problem for trees
• On the packing chromatic number of some lattices
• The packing chromatic number of infinite product graphs
• Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
• Packing coloring of Sierpiński-type graphs
• An infinite family of subcubic graphs with unbounded packing chromatic number
• Packing chromatic number versus chromatic and clique number
• Some diameter notions of the generalized Mycielskian of a graph
• Packing chromatic number of cubic graphs
• Super connectivity and super edge connectivity of the Mycielskian of a graph
• A lower bound for the packing chromatic number of the Cartesian product of cycles
• Modeling the packing coloring problem of graphs
• The packing chromatic number of hypercubes
• A note on packing chromatic number of the square lattice
• 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
• Several parameters of generalized Mycielskians
• Packing chromatic number of base-3 Sierpiński graphs
• The Packing Coloring Problem for (q,q-4) Graphs
• On the packing chromatic number of square and hexagonal lattice
• Multi-coloring the Mycielskian of graphs
• The circular chromatic number of the Mycielskian ofGdk
• Packing Coloring of Undirected and Oriented Generalized Theta Graphs
• The fractional chromatic number of mycielski's graphs
• Packing coloring of generalized Sierpinski graphs
• Mycielskians and matchings
• Sur le coloriage des graphs
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

This page was built for publication: Independence number and packing coloring of generalized Mycielski graphs