D. Mattiolo | Searcharxiv

arXiv2024

Solitude patterns of $r$-graphs via CLM's dependence relation

Recently, Goedgebeur, Mazzuoccolo, Renders, Wolf and the second author [Cubic graphs with edges in exactly one perfect matching, J. Graph Theory 112 (2026), 276-289] proved that every $3$-connected $3$-regular graph has at most six solitary edges; an edge is solitary if it participates in precisely one perfect matching. They also gave complete characterizations of $3$-connected $3$-regular graphs that have $k$ solitary edges for each $k \ge 3$. A connected $r$-regular graph, where $r \geq 3$, is an $r$-graph if each odd cut has at least $r$ edges; for instance, $3$-graphs are precisely the $2$-connected $3$-regular graphs. We generalize the bound and characterizations, mentioned in the preceding paragraph, to $3$-edge-connected $r$-graphs of order four or more; in particular, for $r \geq 4$, we establish stronger bounds:\ (i) at most four solitary edges, and (ii) if the graph is simple then it is devoid of solitary edges. Apart from characterizing all $3$-edge-connected $r$-graphs that have three or more solitary edges, for the case $r=3$, we provide a recursive characterization of those that have precisely two solitary edges such that they lie in the same perfect matching. Finally, for all $r$-graphs (not necessarily $3$-edge-connected), we establish that: (i) every such graph, except for a few small graphs, has at most $\frac{n}{2}$ solitary edges, and (ii) every such graph decomposes uniquely into $3$-edge-connected $r$-graphs, and its solitary edges may be computed recursively via this decomposition. Our proofs and insights rely heavily on the dependence and mutual dependence relationships introduced and investigated by Carvalho, Lucchesi and Murty [Ear decompositions of matching covered graphs, Combinatorica 19 (1999), 151-174].

math.CO↗

arXiv2024

A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs

A proper total colouring of a graph $G$ is called harmonious if it has the further property that when replacing each unordered pair of incident vertices and edges with their colours, then no pair of colours appears twice. The smallest number of colours for it to exist is called the harmonious total chromatic number of $G$, denoted by $h_t(G)$. Here, we give a general upper bound for $h_t(G)$ in terms of the order $n$ of $G$. Our two main results are obvious consequences of the computation of the harmonious total chromatic number of the complete graph $K_n$ and of the complete multigraph $\lambda K_n$, where $\lambda$ is the number of edges joining each pair of vertices of $K_n$. In particular, Araujo-Pardo et al. have recently shown that $\frac{3}{2}n\leq h_t(K_n) \leq \frac{5}{3}n +\theta(1)$. In this paper, we prove that $h_t(K_{n})=\left\lceil \frac{3}{2}n \right\rceil$ except for $h_t(K_{1})=1$ and $h_t(K_{4})=7$; therefore, $h_t(G) \le \left\lceil \frac{3}{2}n \right\rceil$, for every graph $G$ on $n>4$ vertices. Finally, we extend such a result to the harmonious total chromatic number of the complete multigraph $\lambda K_n$ and as a consequence show that $h_t(\mathcal{G})\leq (\lambda-1)(2\left\lceil\frac{n}{2}\right\rceil-1)+\left\lceil\frac{3n}{2}\right\rceil$ for $n>4$, where $\mathcal{G}$ is a multigraph such that $\lambda$ is the maximum number of edges between any two vertices.

math.CO↗