A Linear Algorithm to Color i-Triangulated Graphs
نویسندگان
چکیده
We show that i-triangulated graphs can be colored in linear time by applying lexicographic breadth-first search (abbreviated LexBFS) and the greedy coloring algorithm.
منابع مشابه
Finding the maximum-weight induced k-partite subgraph of an i-triangulated graph
An i-triangulated graph is a graph in which every odd cycle has two non-crossing chords; i-triangulated graphs form a subfamily of perfect graphs. A slightly more general family of perfect graphs are clique-separable graphs. A graph is clique-separable precisely if every induced subgraph either has a clique cutset, or is a complete multipartite graph or a clique joined to an arbitrary bipartite...
متن کاملMeyniel Weakly Triangulated Graphs - I: Co-perfect Orderability
We show that Meyniel weakly triangulated graphs are co-perfectly orderable (equivalently , that P 5-free weakly triangulated graphs are perfectly orderable). Our proof is algorithmic, and relies on a notion concerning separating sets, a property of weakly triangulated graphs, and several properties of Meyniel weakly triangulated graphs.
متن کاملRecognizing Weakly Triangulated Graphs by Edge Separability
We apply Lekkerkerker and Boland's recognition algorithm for tri-angulated graphs to the class of weakly triangulated graphs. This yields a new characterization of weakly triangulated graphs, as well as a new O(m 2) recognition algorithm which, unlike the previous ones, is not based on the notion of a 2-pair, but rather on the structural properties of the minimal separators of the graph. It als...
متن کاملA Simple Linear Time Algorithm for Triangulating Three-Colored Graphs
In this paper we consider the problem of determining whether a given colored graph can be triangulated, such that no edges between vertices of the same color are added. This problem originated from the Perfect Phylogeny problem from molecular biology, and is strongly related with the problem of recognizing partial k-trees. In this paper we give a simple linear time algorithm that solves the pro...
متن کاملHamiltonian Cycles in Triangle Graphs
We prove that the Hamiltonian cycle problem is NP complete for a class of planar graphs named triangle graphs that are closely related to inner triangulated graphs We present a linear time heuristic algorithm that nds a solution at most one third longer than the optimum solution and use it to obtain a fast rendering algorithm on triangular meshes in computer graphics
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 70 شماره
صفحات -
تاریخ انتشار 1999