2 papers
math.CO2024
Limits and Periodicity of Metamour -Distance Graphs
William Q. Erickson, Daniel Herden, Jonathan Meddaugh +3
Given a finite simple graph , let denote its 2-distance graph, in which two vertices are adjacent if and only if they have distance 2 in . In this paper…
math.CO2024
On Criticality and Additivity of the Pseudoachromatic Number Under Join
Jonathan Meddaugh, Mark R. Sepanski, Yegnanarayanan Venkataraman
A vertex coloring of a graph is said to be pseudocomplete if, for any two distinct colors, there exists at least one edge with those two colors as its end vertices. The pseudoachro…