✦ LIBER ✦

On Upper Bound Graphs with Respect to Unary Operations on Graphs

✍ Scribed by Hiroshi Era; Kenjiro Ogawa; Morimasa Tsuchida

Book ID: 105764610
Publisher: Springer
Year: 2002
Tongue: English
Weight: 76 KB
Volume: 6
Category: Article
ISSN: 0218-0006
DOI: 10.1007/s00026-002-8025-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On upper bound graphs whose complements

On upper bound graphs whose complements are also upper bound graphs

✍ Hiroshi Era; Morimasa Tsuchiya 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 348 KB

On distance two graphs of upper bound gr

On distance two graphs of upper bound graphs

✍ Kenjiro Ogawa; Satoshi Tagusari; Morimasa Tsuchiya 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 190 KB

On upper bounds for Laplacian graph eige

On upper bounds for Laplacian graph eigenvalues

✍ Dongmei Zhu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 150 KB

On graphs critical with respect to edge-

On graphs critical with respect to edge-colourings

✍ Hian Poh Yap 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 698 KB

A note on construction of upper bound gr

A note on construction of upper bound graphs

✍ Hiroshi Era; Shin-ichi Iwai; Kenjiro Ogawa; Morimasa Tsuchiyao 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 293 KB

On graphs critical with respect to verte

On graphs critical with respect to vertex partition numbers

✍ Peter Mihók 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 362 KB

For k 3 0, pk(G) den ot e s the Lick-White vertex partition number of G. A graph G is called (n, k)-critical 'f 't I I is connected and for each edge e of G Pk (G -e) < pk (G) = n. We describe all (2, k&critical graphs and for n 23, k 2 1 we extend and simplify a result of Bollobas and Harary giving