𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear-time recognition algorithm for P4-reducible graphs

✍ Scribed by B. Jamison; S. Olariu

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
934 KB
Volume
145
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Simple Linear Time Algorithm for Trian
A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs
✍ H. Bodlaender; T. Kloks πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 560 KB

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 recog

A recognition algorithm for the total gr
A recognition algorithm for the total graphs
✍ F. Gavril πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 581 KB

## Abstract A graph H is called total if there exists a graph G such that there is a one‐to‐one correspondence between the vertices of H and the vertices and edges of G such that two vertices of H are adjacent iff the corresponding elements of G are adjacent or incident. In this paper we present a