✦ LIBER ✦

A note on the parity of the number of crossings of a graph

✍ Scribed by D.J Kleitman

Book ID: 107884053
Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 129 KB
Volume: 21
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(76)90032-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the interval number of a graph

✍ Paul Erdös; Douglas B. West 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 353 KB

Three results on the interval number of a graph on n vertices are presented. (1) The interval number of almost every graph is between n/4 Ig n and n/4 (this also holds for almost every bipartite graph). ( 2) There exist K+\_,, -free bipartite graphs with interval number at least c(m)n 1-2'Cm+1J/lg

On the parity of crossing numbers

✍ Dan Archdeacon; R. Bruce Richter 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB

The parity of the number of 1-factors of

The parity of the number of 1-factors of a graph

✍ Charles H.C. Little 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 344 KB

A Note on the Domination Number of a Bip

A Note on the Domination Number of a Bipartite Graph

✍ J. Harant; A. Pruchnewski 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 61 KB

A note on the bichromatic numbers of gra

A note on the bichromatic numbers of graphs

✍ Dennis D. A. Epple; Jing Huang 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB 👁 2 views

The book crossing number of a graph

✍ Shahrokhi, Farhad; Sz�kely, L�szl� A.; S�kora, Ondrej; Vrt'o, Imrich 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 581 KB

Let G be a graph on n vertices and m edges. The book crossing number of G is defined as the minimum number of edge crossings when the vertices of G are placed on the spine of a k-page book and edges are drawn on pages, such that each edge is contained by one page. Our main results are t w o polynomi