A note on 1-planar graphs
β Scribed by Ackerman, Eyal
- Book ID
- 124110930
- Publisher
- Elsevier Science
- Year
- 2014
- Tongue
- English
- Weight
- 303 KB
- Volume
- 175
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Some new properties of the distribution of elements and vertices with respect to the windows of a connected planar graph G are established. It is also shown that a window matrix of G has properties similar to the properties of an incidence matrix of a graph which is not necessarily planar. A method
A graph G is called (k, d)\*-choosable if, for every list assignment L satisfying [L(v)l = k for all v E V(G), there is an L-coloring of G such that each vertex of G has at most d neighbors colored with the same color as itself. In this note, we prove that every planar graph without 4-cycles and /-c