Diameter-two graphs whose mutual-visibility chromatic number equals their chromatic number
math.CO, cs.DM
Submitted: 2026-10-29
Updated: 2026-10-29
Comments: 8 pages, 3 figures. Submitted to Aequationes Mathematicae
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality