Graph classes generated by Mycielskians

DOI10.7151/dmgt.2345zbMath1446.05030OpenAlexW3044155899MaRDI QIDQ2194538

Ewa Drgas-Burchardt, Mieczysław Borowiecki, Piotr Borowiecki, Elżbieta Sidorowicz

Publication date: 26 August 2020

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

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

zbMATH Keywords

graph coloringchromatic numberMycielski graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Generalised Mycielski graphs, signature systems, and bounds on chromatic numbers
• Edge-chromatic numbers of Mycielski graphs
• Circular chromatic numbers of Mycielski's graphs
• Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
• Meet- and join-irreducibility of additive hereditary properties of graphs
• Packing chromatic number versus chromatic and clique number
• Computational aspects of greedy partitioning of graphs
• Circular chromatic number for iterated Mycielski graphs
• A survey on packing colorings
• Several parameters of generalized Mycielskians
• Hall ratio of the Mycielski graphs
• On the total graph of Mycielski graphs, central graphs and their covering numbers
• A survey of hereditary properties of graphs
• The fractional chromatic number of mycielski's graphs
• Fractional colorings with large denominators
• Mycielskians and matchings
• Sur le coloriage des graphs
• A lower bound on the chromatic number of Mycielski graphs

This page was built for publication: Graph classes generated by Mycielskians