✦ LIBER ✦

A note on a conjecture about commuting graphs

✍ Scribed by Miguel, C.

Book ID: 123533166
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 254 KB
Volume: 438
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2013.02.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a conjecture about uniquely colorable

On a conjecture about uniquely colorable perfect graphs

✍ Gábor Bacsó 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 894 KB

About a conjecture on the centers of cho

About a conjecture on the centers of chordal graphs

✍ K. S. Parvathy; A. Remadevi; A. Vijayakumar 📂 Article 📅 1994 🏛 Springer Japan 🌐 English ⚖ 81 KB

A new conjecture about minimal imperfect

A new conjecture about minimal imperfect graphs

✍ H Meyniel; S Olariu 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 208 KB

A remark on Mulder's conjecture about in

A remark on Mulder's conjecture about interval-regular graphs

✍ K. Nomura 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Let F be a connected graph. F is said to be interval-regular if I F~\_ l(u) uF(x )J =. i holds for all vertices u and x ~ Fi(u), i > 0. For u, v e F, let I (u, v) denote the set of all vertices on a shortest path connecting u, v. A subset W of V(F) is said to be convex if l(u,v) c W holds for each u

A note on a conjecture by Gavril on cliq

A note on a conjecture by Gavril on clique separable graphs

✍ D.G. Corneil; J.M. Keil 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 193 KB

conjecture concerning the characterization of clique

On a Conjecture about Trees in Graphs wi

On a Conjecture about Trees in Graphs with Large Girth

✍ Tao Jiang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 169 KB

The girth of a graph G is the length of a shortest cycle in G. Dobson (1994, Ph.D. dissertation, Louisiana State University, Baton Rouge, LA) conjectured that every graph G with girth at least 2t+1 and minimum degree at least kÂt contains every tree T with k edges whose maximum degree does not excee