41 research outputs found
Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration
We continue research into a well-studied family of problems that ask whether the vertices of a given graph can be partitioned into sets A and B, where A is an independent set and B induces a graph from some specified graph class G. We consider the case where G is the class of k-degenerate graphs. This problem is known to be polynomial-time solvable if k = 0 (recognition of bipartite graphs), but NP-complete if k = 1 (near-bipartite graphs) even for graphs of maximum degree 4. Yang and Yuan [DM, 2006] showed that the k = 1 case is polynomial-time solvable for graphs of maximum degree 3. This also follows from a result of Catlin and Lai [DM, 1995]. We study the general k ≥ 1 case for n-vertex graphs of maximum degree k + 2 We show how to find A and B in O(n) time for k = 1, and in O(n 2 ) time for k ≥ 2. Together, these results provide an algorithmic version of a result of Catlin [JCTB, 1979] and also provide an algorithmic version of a generalization of Brook’s Theorem, proved by Borodin, Kostochka and Toft [DM, 2000] and Matamala [JGT, 2007]. The results also enable us to solve an open problem of Feghali et al. [JGT, 2016]. For a given graph G and positive integer `, the vertex colouring reconfiguration graph of G has as its vertex set the set of `-colourings of G and contains an edge between each pair of colourings that differ on exactly on vertex. We complete the complexity classification of the problem of finding a path in the reconfiguration graph between two given `-colourings of a given graph of maximum degree k
Recognizing graphs close to bipartite graphs.
We continue research into a well-studied family of problems that ask if the vertices of a graph can be partitioned into sets A and B, where A is an independent set and B induces a graph from some specified graph class G. We let G be the class of k-degenerate graphs. The problem is known to be polynomial-time solvable if k=0 (bipartite graphs) and NP-complete if k=1 (near-bipartite graphs) even for graphs of diameter 4, as shown by Yang and Yuan, who also proved polynomial-time solvability for graphs of diameter 2. We show that recognizing near-bipartite graphs of diameter 3 is NP-complete resolving their open problem. To answer another open problem, we consider graphs of maximum degree D on n vertices. We show how to find A and B in O(n) time for k=1 and D=3, and in O(n^2) time for k >= 2 and D >= 4. These results also provide an algorithmic version of a result of Catlin [JCTB, 1979] and enable us to complete the complexity classification of another problem: finding a path in the vertex colouring reconfiguration graph between two given k-colourings of a graph of bounded maximum degree
Topics in Graph Theory: Extremal Intersecting Systems, Perfect Graphs, and Bireflexive Graphs
In this thesis we investigate three different aspects of graph theory.
Firstly, we consider interesecting systems of independent sets in graphs, and the extension of the classical theorem of Erdos, Ko and Rado to graphs.
Our main results are a proof of an Erdos-Ko-Rado type theorem for a class of trees, and a class of trees which form counterexamples to a conjecture of Hurlberg and Kamat, in such a way that extends the previous counterexamples given by Baber.
Secondly, we investigate perfect graphs - specifically, edge modification aspects of perfect graphs and their subclasses. We give some alternative characterisations of perfect graphs in terms of edge modification, as well as considering the possible connection of the critically perfect graphs - previously studied by Wagler - to the Strong Perfect Graph Theorem. We prove that the situation where critically perfect graphs arise has no analogue in seven different subclasses of perfect graphs (e.g. chordal, comparability graphs), and consider the connectivity of a bipartite reconfiguration-type graph associated to each of these subclasses.
Thirdly, we consider a graph theoretic structure called a bireflexive graph where every vertex is both adjacent and nonadjacent to itself, and use this to characterise modular decompositions as the surjective homomorphisms of these structures. We examine some analogues of some graph theoretic notions and define a “dual” version of the reconstruction conjecture
Partitioning a graph into degenerate subgraphs
Let be a connected graph with maximum degree distinct
from . Given integers and , is
said to be -partitionable if there exists a partition of
into sets~ such that is -degenerate for
. In this paper, we prove that we can find a -partition of in -time whenever and . This generalizes a result of Bonamy
et al. (MFCS, 2017) and can be viewed as an algorithmic extension of Brooks'
theorem and several results on vertex arboricity of graphs of bounded maximum
degree.
We also prove that deciding whether is -partitionable is
-complete for every and pairs of non-negative integers
such that and . This resolves an
open problem of Bonamy et al. (manuscript, 2017). Combined with results of
Borodin, Kostochka and Toft (\emph{Discrete Mathematics}, 2000), Yang and Yuan
(\emph{Discrete Mathematics}, 2006) and Wu, Yuan and Zhao (\emph{Journal of
Mathematical Study}, 1996), it also settles the complexity of deciding whether
a graph with bounded maximum degree can be partitioned into two subgraphs of
prescribed degeneracy.Comment: 16 pages; minor revisio
LIPIcs, Volume 248, ISAAC 2022, Complete Volume
LIPIcs, Volume 248, ISAAC 2022, Complete Volum