The following pages link to (Q3699704):
Displaying 36 items.
- Hamiltonicity and generalised total colourings of planar graphs (Q274671) (← links)
- Outer 1-planar graphs (Q289919) (← links)
- Joins of 1-planar graphs (Q477875) (← links)
- A linear-time algorithm for testing outer-1-planarity (Q494794) (← links)
- The edge chromatic number of outer-1-planar graphs (Q906489) (← links)
- On some geometric properties of rectilinear representations of graphs with continuum many edges (Q1021298) (← links)
- Rectangular grid drawings of plane graphs (Q1392851) (← links)
- A successful concept for measuring non-planarity of graphs: The crossing number. (Q1422437) (← links)
- Total coloring of outer-1-planar graphs with near-independent crossings (Q1680477) (← links)
- Recognizing optimal 1-planar graphs in linear time (Q1702117) (← links)
- 1-fan-bundle-planar drawings of graphs (Q1708027) (← links)
- Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity (Q1725786) (← links)
- A linear-time algorithm for testing full outer-2-planarity (Q1727743) (← links)
- Light paths and edges in families of outer-1-planar graphs (Q1751428) (← links)
- List edge coloring of outer-1-planar graphs (Q2023746) (← links)
- Linear arboricity of outer-1-planar graphs (Q2033994) (← links)
- On list \(r\)-hued coloring of outer-1-planar graphs (Q2101936) (← links)
- Optimal-area visibility representations of outer-1-plane graphs (Q2151451) (← links)
- On the recognition of fan-planar and maximal outer-fan-planar graphs (Q2408919) (← links)
- Note on spatial graphs with good drawings (Q2708783) (← links)
- On Rectilinear Drawing of Graphs (Q3557881) (← links)
- Sand drawings and Gaussian graphs§ (Q3592365) (← links)
- Rectilinear drawings of graphs (Q3794220) (← links)
- Rectilinear drawing of a graph on a plane with the minimum number of line segments (Q3977596) (← links)
- Graphic representation of linear recursive rules (Q4012700) (← links)
- Recognizing IC-Planar and NIC-Planar Graphs (Q4566013) (← links)
- The structure and the list 3-dynamic coloring of outer-1-planar graphs (Q5024667) (← links)
- Drawing outer-1-planar graphs revisited (Q5084704) (← links)
- Rectangular diagrams of Legendrian graphs (Q5174871) (← links)
- On the net-embeddability of graphs (Q5288744) (← links)
- Graph Drawing (Q5711597) (← links)
- What Can You Draw? (Q5872826) (← links)
- Shape-faithful graph drawings (Q6117038) (← links)
- Strong Edge Coloring of Outerplane Graphs with Independent Crossings (Q6489818) (← links)
- On book crossing numbers of the complete graph (Q6552472) (← links)
- Conflict-free incidence coloring of outer-1-planar graphs (Q6639485) (← links)
