The following pages link to The structure of 1-planar graphs (Q868353):
Displaying 40 items.
- On the recognition of fan-planar and maximal outer-fan-planar graphs (Q2408919) (← links)
- The book thickness of 1-planar graphs is constant (Q2408921) (← links)
- An upper bound on the sum of powers of the degrees of simple 1-planar graphs (Q2448897) (← links)
- Minimal non-1-planar graphs (Q2470008) (← links)
- A classification of all 1-Salem graphs (Q2827289) (← links)
- On properties of maximal 1-planar graphs (Q2866418) (← links)
- On the sum of powers of the degrees of graphs (Q2872000) (← links)
- (Q2934644) (← links)
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time (Q2961525) (← links)
- (Q3090031) (← links)
- Right Angle Crossing Graphs and 1-Planarity (Q3223950) (← links)
- On local properties of 1-planar graphs with high minimum degree (Q3225725) (← links)
- Contact Representations of Graphs in 3D (Q3449802) (← links)
- On local structure of 1-planar graphs of minimum degree 5 and girth 4 (Q3559386) (← links)
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing (Q3611864) (← links)
- Connectivity and planarity of g-noncommuting graph of finite groups (Q4563579) (← links)
- More on the structure of plane graphs with prescribed degrees of vertices, faces, edges and dual edges (Q4604522) (← links)
- Beyond Planar Graphs: Introduction (Q5001653) (← links)
- 1-Planar Graphs (Q5001656) (← links)
- Algorithms for 1-Planar Graphs (Q5001657) (← links)
- Drawing graph joins in the plane with restrictions on crossings (Q5005479) (← links)
- The structure and the list 3-dynamic coloring of outer-1-planar graphs (Q5024667) (← links)
- The linear 2-arboricity of 1-planar graphs without 3-cycles (Q5025157) (← links)
- On the Size of Matchings in 1-Planar Graph with High Minimum Degree (Q5046627) (← links)
- Long cycles and spanning subgraphs of locally maximal 1‐planar graphs (Q5066913) (← links)
- From light edges to strong edge-colouring of 1-planar graphs (Q5130733) (← links)
- Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles (Q5144877) (← links)
- Note on improper coloring of $1$-planar graphs (Q5206449) (← links)
- (Q5370650) (← links)
- 1-planar graphs are odd 13-colorable (Q6041551) (← links)
- Light edges in 1‐planar graphs (Q6046651) (← links)
- All 2-planar graphs having the same spanning subgraph (Q6087085) (← links)
- (Q6104072) (← links)
- The maximum matching extendability and factor-criticality of 1-planar graphs (Q6110614) (← links)
- Double-toroidal and \(1\)-planar non-commuting graph of a group (Q6113651) (← links)
- 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable (Q6137013) (← links)
- A new note on 1-planar graphs with minimum degree 7 (Q6204300) (← links)
- Spectral extrema of 1-planar graphs (Q6553183) (← links)
- On restricted matching extension of 1-embeddable graphs in surfaces with small genus (Q6589143) (← links)
- The vertex arboricity of 1-planar graphs (Q6616434) (← links)
