Independence, matching and packing coloring of the iterated Mycielskian of graphs
From MaRDI portal
Publication:6657219
DOI10.1016/j.dam.2024.09.015MaRDI QIDQ6657219
Publication date: 6 January 2025
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)
This page was built for publication: Independence, matching and packing coloring of the iterated Mycielskian of graphs
