✦ LIBER ✦

On the existence of subgraphs with degree constraints

✍ Scribed by Claude Berge; Michel Las Vergnas

Publisher: Elsevier Science
Year: 1978
Weight: 562 KB
Volume: 81
Category: Article
ISSN: 1385-7258
DOI: 10.1016/s1385-7258(78)80007-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the existence of a specified cycle in

On the existence of a specified cycle in digraphs with constraints on degrees

✍ Abdelhamid Benhocine 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 326 KB 👁 1 views

We prove that Woodall's and GhouileHouri's conditions on degrees which ensure that a digraph is Hamiltonian, also ensure that it contains the analog of a directed Hamiltonian cycle but with one edge pointing the wrong way; that is, it contains two vertices that are connected in the same direction by

On induced subgraphs with odd degrees

✍ Yair Caro 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 336 KB

Solving a problem of Alon, we prove that every graph G on n vertices with 6(G) 2 1 contains an induced subgraph H such that all the degrees in H are odd and 1 V(H)\ >(l -o(l))Jn/6.

On Induced Subgraphs with All Degrees Od

On Induced Subgraphs with All Degrees Odd

✍ A.D. Scott 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 156 KB

On induced subgraphs of trees, with rest

On induced subgraphs of trees, with restricted degrees

✍ Y. Caro; I. Krasikov; Y. Roditty 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 313 KB

On 2-Connected Spanning Subgraphs with L

On 2-Connected Spanning Subgraphs with Low Maximum Degree

✍ Daniel P Sanders; Yue Zhao 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 408 KB

Given a graph G, let a k-trestle of G be a 2-connected spanning subgraph of G of maximum degree at most k. Also, let /(G) be the Euler characteristic of G. This paper shows that every 3-connected graph G has a (10&2/(G))-trestle. If /(G) &5, this is improved to 8&2/(G), and for /(G) &10, this is fur

Graph decomposition with constraints on

Graph decomposition with constraints on the minimum degree

✍ John Sheehan 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 888 KB

Let G be a finite simple graph on n vertices with minimum degree 6(G) 3 6 (n = 6 (mod 2)). Let max(k, G) denote the set of all k-subsets A E V(G) such that the number of edges in the induced subgraph (A) is a maximum. We prove that for some i E (0, 1.2, . . . ). Analogous edge density constraints, r