✦ LIBER ✦

The structure of 4--critical graphs with a cut vertex

✍ Scribed by W. Ananchuen; N. Ananchuen; R.E.L. Aldred

Book ID: 108114238
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 433 KB
Volume: 310
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.05.029

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The diameter of total domination vertex

The diameter of total domination vertex critical graphs

✍ Wayne Goddard; Teresa W. Haynes; Michael A. Henning; Lucas C. van der Merwe 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 193 KB

A technique for computing the zero forci

A technique for computing the zero forcing number of a graph with a cut-vertex

✍ Darren D. Row 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 354 KB

The structure of quasi 4-connected graph

The structure of quasi 4-connected graphs

✍ Themistocles Politof; A. Satyanarayana 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 646 KB

A minimal point disconnecting set S of a graph G is a nontrivial m-separator, where m = IS I, if the connected components of G -S can be partitioned into two subgraphs each of which has at least two points. A 3-connected graph is quasi 4-connected if it has no nontrivial 3separators. This paper prov

The A4-structure of a graph

✍ Michael D. Barrus; Douglas B. West 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 215 KB

On the nullity of a graph with cut-point

On the nullity of a graph with cut-points

✍ Shi-Cai Gong; Guang-Hui Xu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 327 KB

The least eigenvalue of a graph with cut

The least eigenvalue of a graph with cut vertices

✍ Yi Wang; Yi-Zheng Fan 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 175 KB