𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of regular subgraph recognition

✍ Scribed by F. Cheah; D.G. Corneil

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
600 KB
Volume
27
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Complexity of KΓΆnig Subgraph Problem
The Complexity of KΓΆnig Subgraph Problems and
✍ Sounaka Mishra; Venkatesh Raman; Saket Saurabh; Somnath Sikdar; C. R. Subramania πŸ“‚ Article πŸ“… 2010 πŸ› Springer 🌐 English βš– 778 KB
Three-regular Subgraphs of Four-regular
Three-regular Subgraphs of Four-regular Graphs
✍ O. Moreno; V.A. Zinoviev πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 85 KB

For any 4-regular graph G (possibly with multiple edges), we prove that, if the number N of distinct Euler orientations of G is such that N ≑ 1 (mod 3), then G has a 3-regular subgraph. It gives the new 4-regular graphs with multiple edges which have no 3-regular subgraphs, for which we know the num

Three-regular subgraphs of four-regular
Three-regular subgraphs of four-regular graphs
✍ V. ChvΓ‘tal; H. Fleischner; J. Sheehan; C. Thomassen πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 553 KB

## Abstract Berge conjectured that every finite simple 4‐regular graph __G__ contains a 3‐regular subgraph. We prove that this conjecture is true if the cyclic edge connectivity Ξ»^__c__^(__G__) of __G__ is at least 10. Also we prove that if __G__ is a smallest counterexample, then Ξ»^__c__^(__G__) i