๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Cutsets in ak-connected graph

โœ Scribed by D. V. Karpov

Publisher
Springer US
Year
2007
Tongue
English
Weight
243 KB
Volume
145
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Removable edges in cycles of ak-connecte
Removable edges in cycles of ak-connected graph
โœ Li Qiong Xu; Xiao Feng Guo ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Institute of Mathematics, Chinese Academy of Scien ๐ŸŒ English โš– 194 KB
Matching cutsets in graphs
Matching cutsets in graphs
โœ Augustine M. Moshi ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 504 KB

Let G = ( Y E ) be an undirected graph. A subset F of E is a matching cutset of G if no two edges of Fare incident with the same point, and G-F has more components than G. ChGatal [2] proved that it is NP-complete to recognize graphs with a matching cutset even if the input is restricted to graphs w

Galaxy cutsets in graphs
Galaxy cutsets in graphs
โœ Nicolas Sonnerat; Adrian Vetta ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Springer US ๐ŸŒ English โš– 363 KB
Connected cutsets of a graph and triangl
Connected cutsets of a graph and triangle bases of the cycle space
โœ P Duchet; M Las Vergnas; H Meyniel ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 602 KB

We investigate some properties of graphs whose cycle space has a basis constituted of triangles ('null-homotopic' graphs). We obtain characterizations in the case of planar graphs, and more generally, of graphs not contractible onto Ks. These characterizations involve separating subsets and decompos