The exponential growth of the packing chromatic number of iterated Mycielskians
DOI10.1016/j.dam.2023.08.007OpenAlexW4386397988MaRDI QIDQ6069170
Ez Zobair Bidine, Taoufiq Gadi, Mustapha Kchikech
Publication date: 13 November 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.08.007
packing chromatic numberpacking coloringmaximal triangle-free graphsMycielskiansiterated Mycielskians
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(S\)-packing colorings of cubic graphs
- Packing chromatic number under local changes in a graph
- Complexity of the packing coloring problem for trees
- Circular chromatic numbers of Mycielski's graphs
- Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
- Packing chromatic number versus chromatic and clique number
- Packing chromatic number of cubic graphs
- For which densities are random triangle-free graphs almost surely bipartite?
- Super connectivity and super edge connectivity of the Mycielskian of a graph
- A survey on packing colorings
- Several parameters of generalized Mycielskians
- Packing chromatic number of base-3 Sierpiński graphs
- Independence number and packing coloring of generalized Mycielski graphs
- The typical structure of sparse $K_{r+1}$-free graphs
- The number of the maximal triangle-free graphs
- THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS
- Multi-coloring the Mycielskian of graphs
- The circular chromatic number of the Mycielskian ofGdk
- On minimal triangle‐free 6‐chromatic graphs
- Mycielskians and matchings
- Sur le coloriage des graphs
This page was built for publication: The exponential growth of the packing chromatic number of iterated Mycielskians
