𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Irredundancy in circular arc graphs

✍ Scribed by Martin Charles Golumbic; Renu C. Laskar

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
676 KB
Volume
44
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Stability in circular arc graphs
Stability in circular arc graphs
✍ Martin Charles Golumbic; Peter L Hammer πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 426 KB
Algorithms on circular-arc graphs
Algorithms on circular-arc graphs
✍ F. Gavril πŸ“‚ Article πŸ“… 1974 πŸ› John Wiley and Sons 🌐 English βš– 596 KB
Irredundance in inflated graphs
Irredundance in inflated graphs
✍ Favaron, Odile πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 263 KB πŸ‘ 2 views

The inflation G I of a graph G with n(G) vertices and m(G) edges is obtained by replacing every vertex of degree d of G by a clique K d . We study the lower and upper irredundance parameters ir and IR of an inflation. We prove in particular that if Ξ³ denotes the domination number of a graph, Ξ³(G I )

Partial characterizations of circular-ar
Partial characterizations of circular-arc graphs
✍ F. Bonomo; G. DurΓ‘n; L.N. Grippo; M.D. Safe πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 224 KB

## Abstract A circular‐arc graph is the intersection graph of a family of arcs on a circle. A characterization by forbidden induced subgraphs for this class of graphs is not known, and in this work we present a partial result in this direction. We characterize circular‐arc graphs by a list of minim