86 research outputs found
On claw-free asteroidal triple-free graphs
AbstractWe present an O(n2.376) algorithm for recognizing claw-free AT-free graphs and a linear-time algorithm for computing the set of all central vertices of a claw-free AT-free graph. In addition, we give efficient algorithms that solve the problems INDEPENDENT SET, DOMINATING SET, and COLORING. We argue that all running times achieved are optimal unless better algorithms for a number of famous graph problems such as triangle recognition and bipartite matching have been found. Our algorithms exploit the structure of 2LexBFS schemes of claw-free AT-free graphs
Boxicity and Cubicity of Asteroidal Triple free graphs
An axis parallel -dimensional box is the Cartesian product where each is a closed interval on the real line.
The {\it boxicity} of a graph , denoted as \boxi(G), is the minimum
integer such that can be represented as the intersection graph of a
collection of -dimensional boxes. An axis parallel unit cube in
-dimensional space or a -cube is defined as the Cartesian product where each is a closed interval on the
real line of the form . The {\it cubicity} of , denoted as
\cub(G), is the minimum integer such that can be represented as the
intersection graph of a collection of -cubes.
Let denote a star graph on nodes. We define {\it claw number} of
a graph as the largest positive integer such that is an induced
subgraph of and denote it as \claw.
Let be an AT-free graph with chromatic number and claw number
\claw. In this paper we will show that \boxi(G) \leq \chi(G) and this bound
is tight. We also show that \cub(G) \leq \boxi(G)(\ceil{\log_2 \claw} +2)
\chi(G)(\ceil{\log_2 \claw} +2). If is an AT-free graph having
girth at least 5 then \boxi(G) \leq 2 and therefore \cub(G) \leq
2\ceil{\log_2 \claw} +4.Comment: 15 pages: We are replacing our earlier paper regarding boxicity of
permutation graphs with a superior result. Here we consider the boxicity of
AT-free graphs, which is a super class of permutation graph
Proper circular arc graphs as intersection graphs of paths on a grid
In this paper we present a characterisation, by an infinite family of minimal
forbidden induced subgraphs, of proper circular arc graphs which are
intersection graphs of paths on a grid, where each path has at most one bend
(turn)
The leafage of a chordal graph
The leafage l(G) of a chordal graph G is the minimum number of leaves of a
tree in which G has an intersection representation by subtrees. We obtain upper
and lower bounds on l(G) and compute it on special classes. The maximum of l(G)
on n-vertex graphs is n - lg n - (1/2) lg lg n + O(1). The proper leafage l*(G)
is the minimum number of leaves when no subtree may contain another; we obtain
upper and lower bounds on l*(G). Leafage equals proper leafage on claw-free
chordal graphs. We use asteroidal sets and structural properties of chordal
graphs.Comment: 19 pages, 3 figure
Graphs with at most two moplexes
A moplex is a natural graph structure that arises when lifting Dirac's
classical theorem from chordal graphs to general graphs. However, while every
non-complete graph has at least two moplexes, little is known about structural
properties of graphs with a bounded number of moplexes. The study of these
graphs is motivated by the parallel between moplexes in general graphs and
simplicial modules in chordal graphs: Unlike in the moplex setting, properties
of chordal graphs with a bounded number of simplicial modules are well
understood. For instance, chordal graphs having at most two simplicial modules
are interval. In this work we initiate an investigation of -moplex graphs,
which are defined as graphs containing at most moplexes. Of particular
interest is the smallest nontrivial case , which forms a counterpart to
the class of interval graphs. As our main structural result, we show that the
class of connected -moplex graphs is sandwiched between the classes of
proper interval graphs and cocomparability graphs; moreover, both inclusions
are tight for hereditary classes. From a complexity theoretic viewpoint, this
leads to the natural question of whether the presence of at most two moplexes
guarantees a sufficient amount of structure to efficiently solve problems that
are known to be intractable on cocomparability graphs, but not on proper
interval graphs. We develop new reductions that answer this question negatively
for two prominent problems fitting this profile, namely Graph Isomorphism and
Max-Cut. On the other hand, we prove that every connected -moplex graph
contains a Hamiltonian path, generalising the same property of connected proper
interval graphs. Furthermore, for graphs with a higher number of moplexes, we
lift the previously known result that graphs without asteroidal triples have at
most two moplexes to the more general setting of larger asteroidal sets
- …