A New Characterization of Path Graphs

11/20/2019
by   Nicola Apollonio, et al.
0

Path Graphs are intersection graphs of paths in a tree. Path Graphs are closed under taking induced subgraphs and, answering a question posed by Renz [P.L. Renz, Intersection Representations of Graphs by Arcs, Pacific J. Math., 34 (1970), 501-510], Lévêque, Maffray and Preissmann [B. Lévêque, F. Maffray, and M. Preissmann, Characterizing Path Graphs by Forbidden Induced Subgraphs, J. Graph Theory, 62:4 (2009) 369-384] characterized Path Graphs by a list of forbidden minimal subgraphs. In this paper, building on a result due to Monma and Wei [C.L. Monma, and V.K. Wei, Intersection Graphs of Paths in a Tree, J. Combin. Theory Ser. B, 41:2 (1986) 141-181], we introduce the collection of the attachedness graphs of a graph and characterize Path Graphs in three ways: a structural characterization of each of the attachedness graphs, a characterization by a list of five families of minimal forbidden induced 2-edge colored subgraphs in each of the attachedness graphs and, finally, by a list of three families of minimal forbidden (not necessarily induced) 2-edge colored subgraphs in each of the attachedness graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/01/2022

Two New Characterizations of Path Graphs

Path graphs are intersection graphs of paths in a tree. We start from th...
research
08/28/2018

Proper circular arc graphs as intersection graphs of paths on a grid

In this paper we present a characterisation, by an infinite family of mi...
research
03/20/2018

Characterization by forbidden induced subgraphs of some subclasses of chordal graphs

Chordal graphs are the graphs in which every cycle of length at least fo...
research
08/02/2020

Forbidden Induced Subgraphs and the Łoś-Tarski Theorem

Let 𝒞 be a class of finite and infinite graphs that is closed under indu...
research
04/07/2019

A characterization of maximal 2-dimensional subgraphs of transitive graphs

A transitive graph is 2-dimensional if it can be represented as the inte...
research
12/15/2020

A New Algorithm to Recognize Path Graphs

A Path Graph is the intersection graph of vertex paths in an undirected ...
research
04/16/2021

Minimal obstructions to (∞, k)-polarity in cographs

A graph is a cograph if it does not contain a 4-vertex path as an induce...

Please sign up or login with your details

Forgot password? Click here to reset