29,487 research outputs found
Isomorphism of graph classes related to the circular-ones property
We give a linear-time algorithm that checks for isomorphism between two 0-1
matrices that obey the circular-ones property. This algorithm leads to
linear-time isomorphism algorithms for related graph classes, including Helly
circular-arc graphs, \Gamma-circular-arc graphs, proper circular-arc graphs and
convex-round graphs.Comment: 25 pages, 9 figure
Combinatorial Problems on -graphs
Bir\'{o}, Hujter, and Tuza introduced the concept of -graphs (1992),
intersection graphs of connected subgraphs of a subdivision of a graph .
They naturally generalize many important classes of graphs, e.g., interval
graphs and circular-arc graphs. We continue the study of these graph classes by
considering coloring, clique, and isomorphism problems on -graphs.
We show that for any fixed containing a certain 3-node, 6-edge multigraph
as a minor that the clique problem is APX-hard on -graphs and the
isomorphism problem is isomorphism-complete. We also provide positive results
on -graphs. Namely, when is a cactus the clique problem can be solved in
polynomial time. Also, when a graph has a Helly -representation, the
clique problem can be solved in polynomial time. Finally, we observe that one
can use treewidth techniques to show that both the -clique and list
-coloring problems are FPT on -graphs. These FPT results apply more
generally to treewidth-bounded graph classes where treewidth is bounded by a
function of the clique number
Completion of the mixed unit interval graphs hierarchy
We describe the missing class of the hierarchy of mixed unit interval graphs,
generated by the intersection graphs of closed, open and one type of half-open
intervals of the real line. This class lies strictly between unit interval
graphs and mixed unit interval graphs. We give a complete characterization of
this new class, as well as quadratic-time algorithms that recognize graphs from
this class and produce a corresponding interval representation if one exists.
We also mention that the work in arXiv:1405.4247 directly extends to provide a
quadratic-time algorithm to recognize the class of mixed unit interval graphs.Comment: 17 pages, 36 figures (three not numbered). v1 Accepted in the TAMC
2015 conference. The recognition algorithm is faster in v2. One graph was not
listed in Theorem 7 of v1 of this paper v3 provides a proposition to
recognize the mixed unit interval graphs in quadratic time. v4 is a lot
cleare
- …