✦ LIBER ✦

Balanced decompositions of a signed graph

✍ Scribed by Thomas Zasĺavsky

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 779 KB
Volume: 43
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(87)90026-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Balancing signed graphs

✍ J. Akiyama; D. Avis; V. Chvátal; H. Era 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 416 KB

Balance in stochastic signed graphs

✍ Ove Frank; Frank Harary 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 484 KB

On balanced signed graphs and consistent

On balanced signed graphs and consistent marked graphs

✍ Fred S. Roberts 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 560 KB

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.

Bounds on the signed domination number o

Bounds on the signed domination number of a graph

✍ Ruth Haas; Thomas B. Wexler 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Graph Decompositions Satisfying Extremal

Graph Decompositions Satisfying Extremal Degree Constraints

✍ Paul A. Catlin 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 175 KB

## Abstract We show that the vertex set of any graph __G__ with __p__⩾2 vertices can be partitioned into non‐empty sets __V__~1~, __V__~2~, such that the maximum degree of the induced subgraph 〈__V__~i~〉 does not exceed where p^i^ = |__V__^i^|, for __i__=1, 2. Furthermore, the structure of the in