𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characterizations of signed graphs

✍ Scribed by Thomas Zaslavsky

Publisher
John Wiley and Sons
Year
1981
Tongue
English
Weight
271 KB
Volume
5
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The possible classes of balanced circles of a signed graph are characterized in two ways.

πŸ“œ SIMILAR VOLUMES

Signed degree sequences of signed graphs
Signed degree sequences of signed graphs
✍ Yan, Jing-Ho; Lih, Ko-Wei; Kuo, David; Chang, Gerard J. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 105 KB πŸ‘ 2 views

sequence to be the signed degree sequence of a signed graph or a signed tree, answering a question raised by

On graphs with signed inverses
On graphs with signed inverses
✍ Fred Buckley; Lynne L. Doty; Frank Harary πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 271 KB
More characterizations of triangulated g
More characterizations of triangulated graphs
✍ Claude Benzaken; Yves Crama; Pierre Duchet; Peter L. Hammer; FrΓ©dΓ©ric Maffray πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 420 KB

## Abstract New characterizations of triangulated and cotriangulated graphs are presented. Cotriangulated graphs form a natural subclass of the class of strongly perfect graphs, and they are also characterized in terms of the shellability of some associated collection of sets. Finally, the notion o

Regular matroid decomposition via signed
Regular matroid decomposition via signed graphs
✍ Jim Geelen; Bert Gerards πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 129 KB

The key to Seymour's Regular Matroid Decomposition Theorem is his result that each 3-connected regular matroid with no R 10or R 12 -minor is graphic or cographic. We present a proof of this in terms of signed graphs.

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