Tough Coline Graphs: Hamiltonicity and Traceability

• Tough coline graphs are defined as the complements of line graphs of 1-tough graphs, where vertices represent non-incident edges of the original graph.
• Mammoliti’s classification shows that apart from four specific exceptions (like K5 and related graphs), these graphs guarantee Hamiltonicity through robust structural properties.
• The study extends to traceability using pseudo-toughness and longest-cycle techniques, establishing strong links with cyclic matching-sequenceability and graph connectivity.

A tough coline graph is the complement of a line graph of a simple graph $G$ that is $1$-tough—that is, for every vertex cut $S$, the number of connected components after deleting $S$ is at most $|S|$. Coline graphs (denoted $\co(G)$) have as vertices the edges of $G$; two vertices in $\co(G)$ are adjacent precisely when their corresponding edges in $G$ are non-incident. The structural and Hamiltonian properties of these graphs, particularly under the assumption of toughness, have been the subject of several characterizations culminating in a definitive classification for Hamiltonicity and traceability as provided by Mammoliti (Mammoliti, 31 Jan 2026).

1. Definitions and Fundamental Constructions

Let $G=(V,E)$ be a simple graph. The line graph $1$0 is defined on vertex set $1$1 where two vertices (edges of $1$2) are adjacent if and only if they share a common endpoint in $1$3. The coline graph $1$4 is the complement of this line graph on $1$5: for $1$6,

$1$7

A graph $1$8 is $1$9-tough if for every vertex subset $S$0, $S$1, where $S$2 is the number of components of $S$3. The focus here is on $S$4-toughness.

2. Hamiltonicity in Tough Coline Graphs

A principal result (“Mammoliti’s theorem”) provides a near-complete classification of when a tough coline graph is Hamiltonian. If $S$5 is tough, then $S$6 is Hamiltonian unless $S$7 is isomorphic to one of four exceptional graphs: $S$8 where:

• $S$9 is the complete graph on five vertices,
• $S$0 is the triangle with one leaf attached to each vertex ($S$1),
• $S$2 is $S$3 with one leaf-edge subdivided once,
• $S$4 is $S$5 with two leaf-edges each subdivided once.

In all four cases, $S$6 remains $S$7-tough but fails to admit a Hamiltonian cycle. For all other root graphs $S$8, toughness of $S$9 guarantees Hamiltonicity. Notably, $|S|$0 is the Petersen graph, which is $|S|$1-tough but non-Hamiltonian (Mammoliti, 31 Jan 2026).

3. Traceability and Pseudo-Toughness

Hamiltonian path analogues are captured through the concept of traceability. For this, pseudo-toughness is defined: a graph $|S|$2 is pseudo-tough if the graph $|S|$3, formed by adjoining one new universal vertex to $|S|$4, is $|S|$5-tough.

A characterization arises:

• $|S|$6 is traceable if and only if $|S|$7 is pseudo-tough and $|S|$8 is not $|S|$9.
• In the lone exception, $\co(G)$0 fails to contain a Hamiltonian path, though it is pseudo-tough.

This result leverages the equivalence between Hamiltonicity in the augmented graph $\co(G)$1 and traceability in $\co(G)$2 via a dominating vertex construction, and follows from the main Hamiltonicity theorem (Mammoliti, 31 Jan 2026).

4. Longest-Cycle Proof Techniques and Key Lemmas

The proof that toughness enforces Hamiltonicity except for four roots is based on a refined longest-cycle method. If $\co(G)$3 is tough but non-Hamiltonian, and $\co(G)$4 is a longest cycle in $\co(G)$5, several structural phenomena arise:

• $\co(G)$6 is $\co(G)$7-connected, so every component of $\co(G)$8 is a singleton.
• For $\co(G)$9 and its neighbors $G$0 in $G$1's cyclic order, with $G$2 denoting successor/predecessor, the following hold:

Key Lemmas

Lemma	Description	Structural Implication
Neighbourhood-Separation (4.1)	For each neighbor $G$3 of $G$4, none of $G$5 are also neighbors; there are no paths with interior in $G$6 connecting $G$7; certain vertex sets are independent	Restricts how external vertices may connect to $G$8
Four-Chord-Forbidden (4.2)	For any three consecutive neighbors, either all four specified chords are non-edges, or one particular non-edge is present	Precludes chord configurations that allow cycle extension
Edge-Non-Extendability (4.3)	For any chord $G$9 between two external neighbor indices, at least one of two "corner" edges is missing	Prevents extension via new cycle construction

These lemmas lead to a constrained case analysis: only in the four exceptional root graphs $\co(G)$0 does the structure evade Hamiltonicity. In all other cases, a contradiction to cycle maximality arises (Mammoliti, 31 Jan 2026).

5. Structural Corollaries and Further Characterizations

Mammoliti synthesizes earlier results of Wu–Meng and Liu, identifying the root graphs of non-tough coline graphs as precisely those with too few edges, certain adjacency structures in vertices of maximum degree, or matching a short catalog of small graphs (see Corollary 4.2 in (Mammoliti, 31 Jan 2026)). The same framework, lowering the edge count by one, describes all $\co(G)$1 failing traceability.

An application arises for cyclic matching-sequenceability: $\co(G)$2 if and only if $\co(G)$3 is Hamiltonian. Therefore, the Hamiltonicity theorem fully classifies graphs $\co(G)$4 by their cyclic matching-sequenceability of degree two or higher.

6. Significance and Connections

The compactness of Mammoliti’s longest-cycle argument provides both an alternative and a sharpening of established Hamiltonicity and traceability criteria for the complements of line graphs, clarifying the role of toughness in enforcing cycle and path properties. The isolation of a minimal set of exceptional root graphs underscores the strength of toughness in this structural context and establishes deeper links to matching theory and componentwise connectivity in combinatorial optimization (Mammoliti, 31 Jan 2026).