✦ LIBER ✦

On the removal of forbidden graphs by edge-deletion or by edge-contraction

✍ Scribed by Toshimasa Watanabe; Tadashi Ae; Akira Nakamura

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 350 KB
Volume: 3
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(81)90039-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs whose vertex independence number

Graphs whose vertex independence number is unaffected by single edge addition or deletion

✍ George Gunther; Bert Hartnell; Douglas F. Rall 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 383 KB

On the NP-hardness of edge-deletion and

On the NP-hardness of edge-deletion and -contraction problems

✍ Toshimasa Watanabe; Tadashi Ae; Akira Nakamura 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 1015 KB

Separation of graphs into three componen

Separation of graphs into three components by the removal of edges

✍ Donald L. Goldsmith; Bennet Manvel; Vance Faber 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB

## Abstract Several ways to separate a connected graph into three components by the removal of edges are discussed. Graphical parameters that count the number of edges removed are introduced and the relations between these parameters are given.

Covering the edges of a graph by circuit

Covering the edges of a graph by circuits

✍ D. Ya. Kesel'man 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 847 KB

The effect on the Laplacian spectral rad

The effect on the Laplacian spectral radius of a graph by adding or grafting edges

✍ Ji-Ming Guo 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 160 KB

The chromaticity of complete bipartite g

The chromaticity of complete bipartite graphs with at most one edge deleted

✍ C. P. Teo; K. M. Koh 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 364 KB 👁 1 views

## Abstract Let __K(p, q), p ≤ q__, denote the complete bipartite graph in which the two partite sets consist of __p__ and __q__ vertices, respectively. In this paper, we prove that (1) the graph __K(p, q)__ is chromatically unique if __p__ ≥ 2; and (2) the graph __K(p, q)__ ‐ __e__ obtained by del