Paint cost and the frugal distinguishing number
From MaRDI portal
Publication:5058214
DOI10.26493/2590-9770.1463.f59zbMath1502.05056arXiv2103.06097OpenAlexW3135497671MaRDI QIDQ5058214
Publication date: 19 December 2022
Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.06097
determining numberbook graphgraph distinguishingcost of distinguishingfrugal distinguishing numberpaint cost
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- 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
- The distinguishing number of the hypercube
- The cost of 2-distinguishing Cartesian powers
- The cost of 2-distinguishing hypercubes
- Distinguishing infinite graphs
- Breaking the Symmetries of the Book Graph and the Generalized Petersen Graph
- THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH
- The Cost of Distinguishing Graphs
- Small label classes in 2-distinguishing labelings
- Distinguishing Cartesian powers of graphs
- Distinguishing Cartesian powers of graphs
This page was built for publication: Paint cost and the frugal distinguishing number