Name
Abstract | ||
|---|---|---|
graph is called 1-planar if it can be drawn in the plane so that each its edge is crossed by at most one other edge. In the paper, we study the existence of subgraphs of bounded degrees in 1-planar graphs. It is shown that each 1-planar graph contains a vertex of degree at most 7; we also prove that each 3-connected 1-planar graph contains an edge with both endvertices of degrees at most 20, and we present similar results concerning bigger structures in 1-planar graphs with additional constraints. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.disc.2005.11.056 | Discrete Mathematics |
Keywords | Field | DocType |
1-planar graph,light graph,crossing,1 planar graph,planar graph | Discrete mathematics,Indifference graph,Combinatorics,Outerplanar graph,Line graph,Chordal graph,Pathwidth,Symmetric graph,1-planar graph,Mathematics,Planar graph | Journal |
Volume | Issue | ISSN |
307 | 7-8 | Discrete Mathematics |
Citations | PageRank | References |
49 | 3.45 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Igor Fabrici | 1 | 101 | 14.64 |
| Tomáš Madaras | 2 | 112 | 11.15 |