✦ LIBER ✦

An Improved Upper Bound for the Finite Delay of Graphs

✍ Scribed by Vilfan, B.

Book ID: 114587666
Publisher: IEEE
Year: 1970
Tongue: English
Weight: 804 KB
Volume: C-19
Category: Article
ISSN: 0018-9340
DOI: 10.1109/t-c.1970.222944

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved upper bound for Laplacian gr

An improved upper bound for Laplacian graph eigenvalues

✍ Kinkar ch. Das 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 104 KB

An improved upper bound for the Laplacia

An improved upper bound for the Laplacian spectral radius of graphs

✍ Mei Lu; Huiqing Liu; Feng Tian 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 280 KB

An improved upper bound for the bondage

An improved upper bound for the bondage number of graphs on surfaces

✍ Jia Huang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 209 KB

An improved upper bound for the TSP in c

An improved upper bound for the TSP in cubic 3-edge-connected graphs

✍ David Gamarnik; Moshe Lewenstein; Maxim Sviridenko 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 193 KB

Improving an Upper Bound on the Stabilit

Improving an Upper Bound on the Stability Number of a Graph

✍ Carlos J. Luz 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 494 KB

An upper bound for total colouring of gr

An upper bound for total colouring of graphs

✍ Colin J.H. McDiarmid; Abdón Sánchez-Arroyo 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 235 KB

An upper bound for total colouring of graphs, Discrete Mathematics 111 (1993) 3899392. We give an upper bound on the number of colours required to extend a given vertex colouring of a graph to a total colouring. This shows that for any simple graph there is a total colouring using at most :d + 3 co