Distinguishing Generalized Mycielskian Graphs

zbMath1493.05097arXiv2006.03739MaRDI QIDQ5090527

Puck Rombach, Sally Cockburn, K. E. Perry, Sarah Loeb, Debra L. Boutin, Lauren Keough

Publication date: 20 July 2022

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

zbMATH Keywords

Halin graphdistinguishing numbermaximal outerplanar graphdistinguishing index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Distinguishability of infinite groups and graphs
• Cartesian powers of graphs can be distinguished by two labels
• Using determining sets to distinguish Kneser graphs
• Distinguishability of locally finite trees
• Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
• The distinguishing number of the hypercube
• 4-chromatic graphs with large odd girth
• Symmetry breaking in graphs
• Distinguishing infinite graphs
• Several parameters of generalized Mycielskians
• Fractional chromatic numbers of cones over graphs
• Multiple Coloring of Cone Graphs
• Asymmetric trees with two prescribed degrees
• Symmetry breaking in planar and maximal outerplanar graphs
• Sur le coloriage des graphs
• Distinguishing Cartesian powers of graphs
• Distinguishing Cartesian powers of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Distinguishing Generalized Mycielskian Graphs