Symmetry parameters for Mycielskian graphs
From MaRDI portal
Publication:2073195
DOI10.1007/978-3-030-77983-2_5zbMath1482.05082arXiv2103.05417OpenAlexW3134847482MaRDI QIDQ2073195
Sally Cockburn, Puck Rombach, Sarah Loeb, Lauren Keough, K. E. Perry, Debra L. Boutin
Publication date: 1 February 2022
Full work available at URL: https://arxiv.org/abs/2103.05417
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distinguishability of infinite groups and graphs
- Determining number of generalized and double generalized Petersen graph
- Cartesian powers of graphs can be distinguished by two labels
- Identifying graph automorphisms using determining sets
- Using determining sets to distinguish Kneser graphs
- 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
- The cost of 2-distinguishing Cartesian powers
- Distinguishing infinite graphs
- Several parameters of generalized Mycielskians
- Fractional chromatic numbers of cones over graphs
- Multiple Coloring of Cone Graphs
- The determining number of a Cartesian product
- Asymmetric trees with two prescribed degrees
- Symmetry breaking in planar and maximal outerplanar graphs
- The Cost of Distinguishing Graphs
- Small label classes in 2-distinguishing labelings
- Sur le coloriage des graphs
- Distinguishing Cartesian powers of graphs
- Distinguishing Cartesian powers of graphs
This page was built for publication: Symmetry parameters for Mycielskian graphs