✦ LIBER ✦

A new estimate for the vertex number of an edge-regular graph

✍ Scribed by A. A. Makhnev; D. V. Paduchikh

Book ID: 111708012
Publisher: SP MAIK Nauka/Interperiodica
Year: 2007
Tongue: English
Weight: 223 KB
Volume: 48
Category: Article
ISSN: 0037-4466
DOI: 10.1007/s11202-007-0067-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The vertex (edge) independence number, v

The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph

✍ Ying-Ying Tan; Yi-Zheng Fan 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 151 KB

An upper bound for the adjacent vertex d

An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph

✍ Xin-sheng Liu; Ming-qiang An; Yang Gao 📂 Article 📅 2008 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 159 KB

On the Edge Independence Number of a Reg

On the Edge Independence Number of a Regular Graph with Large Edge Connectivity

✍ IZAK BROERE; GARY CHARTRAND; ORTRUND R. OELLERMANN; CURTISS E. WALL 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB

An inequality involving the vertex arbor

An inequality involving the vertex arboricity and edge arboricity of a graph

✍ Stefan A. Burr 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

The acyclic edge chromatic number of a r

The acyclic edge chromatic number of a random d-regular graph is d + 1

✍ Jaroslav Nešetřil; Nicholas C. Wormald 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 67 KB 👁 1 views

## Abstract We prove the theorem from the title: the acyclic edge chromatic number of a random __d__‐regular graph is asymptotically almost surely equal to __d__ + 1. This improves a result of Alon, Sudakov, and Zaks and presents further support for a conjecture that Δ(G) + 2 is the bound for the a

An upper bound for the number of Euleria

An upper bound for the number of Eulerian orientations of a regular graph

✍ M. Las Vergnas 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 168 KB