✦ LIBER ✦

Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs

✍ Scribed by S.R. Das; C.L. Sheng

Book ID: 107766394
Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 469 KB
Volume: 14
Category: Article
ISSN: 0020-0255
DOI: 10.1016/0020-0255(78)90041-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimally k-connected graphs of low orde

Minimally k-connected graphs of low order and maximal size

✍ Cai Mao-cheng 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 563 KB

On the connection between chromatic numb

On the connection between chromatic number, maximal clique and minimal degree of a graph

✍ B. Andrásfai; P. Erdös; V.T. Sós 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 606 KB

Forbidden subgraphs and hamiitonian prop

Forbidden subgraphs and hamiitonian properties in the square of a connected graph

✍ Ronald J. Gould; Michael S. Jacobson 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 331 KB 👁 1 views

Various Hamiltonian-like properties are investigated in the squares of connected graphs free of some set of forbidden subgraphs. The star K,+ the subdivision graph of &, and the subdivision graph of K1,3 minus an endvertex play central roles. In particular, we show that connected graphs free of the

On the hardness of constructing minimal

On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality

✍ Hans-Joachim Böckenhauer; Dirk Bongartz; Juraj Hromkovič; Ralf Klasing; Guido Pr 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 286 KB

A pair of forbidden subgraphs and perfec

A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity

✍ Jun Fujisawa; Shinya Fujita; Michael D. Plummer; Akira Saito; Ingo Schiermeyer 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 282 KB

Subgraphs of large connectivity and chro

Subgraphs of large connectivity and chromatic number in graphs of large chromatic number

✍ N. Alon; D. Kleitman; C. Thomassen; M. Saks; P. Seymour 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

For each pair k, rn of natural numbers there exists a natural number f(k, rn) such that every f ( k , m)-chromatic graph contains a k-connected subgraph of chromatic number at least rn.