𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Structure and recognition of domishold graphs

✍ Scribed by P. Marchioro; A. Morgana

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
698 KB
Volume
50
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A class of threshold and domishold graph
A class of threshold and domishold graphs: equistable and equidominating graphs
✍ Charles Payan πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 484 KB

A thwahold grerph (rtzspativ4y domlshukf graph) is 01 graph for which the independent 881% (rapsctiwzly ths dominuting a&a) cctn bgr chnfuctsrixsd by the 0, l-aolutiona of a linaur ## kpallty (ass [ij and [S]), We define here the #rugher far which the mawlmal indapsndent eettr (rsopsctivsly tha m

Recognition of Circle Graphs
Recognition of Circle Graphs
✍ J. Spinrad πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 736 KB

This paper presents a new algorithm for recognizing circle graphs, combining ideas from an earlier circle graph recognition algorithm due to Gabor, Hsu, and Supowit and an algorithm to determine whether a graph can be decomposed by the split decomposition. The result is an \(O\left(n^{2}\right)\) al

The Structure of Well-Covered Graphs and
The Structure of Well-Covered Graphs and the Complexity of Their Recognition Problems
✍ David Tankus; Michael Tarsi πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 449 KB

A graph is well-covered if all its maximal independent sets are of the same cardinality. Deciding whether a given graph is well-covered is known to be NP-hard in general, and solvable in polynomial time, if the input is restricted to certain families of graphs. We present here a simple structural ch

Classes and Recognition of Curve Contact
Classes and Recognition of Curve Contact Graphs
✍ Petr HlinΔ›nΓ½ πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 737 KB

Contact graphs are a special kind of intersection graphs of geometrical objects in which the objects are not allowed to cross but only to touch each other. Contact graphs of simple curves, and line segments as a special case, in the plane are considered. Various classes of contact graphs are introdu