✦ LIBER ✦

An improved bound on parity vertex colourings of outerplane graphs

✍ Scribed by Weifan Wang; Stephen Finbow; Ping Wang

Book ID: 113567672
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 368 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.04.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 lower bound on the sensitivi

An improved lower bound on the sensitivity complexity of graph properties

✍ Xiaoming Sun 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 313 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 improved edge bound on the interval n

An improved edge bound on the interval number of a graph

✍ Jeremy R. Spinrad; G. Vijayan; Douglas B. West 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 2 views

The upper bound on the interval number of a graph in terms of its number of edges is improved. Also, the interval number of graphs in hereditary classes is bounded in terms of the vertex degrees. A representation of a graph as an intersection graph assigns each vertex a set such that vertices are a