Pages that link to "Item:Q1025913"
From MaRDI portal
The following pages link to Planar graphs without 5-cycles or without 6-cycles (Q1025913):
Displaying 14 items.
- An improved upper bound on the linear 2-arboricity of planar graphs (Q501025) (← links)
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
- An improved upper bound on the linear 2-arboricity of 1-planar graphs (Q831027) (← links)
- Linear 2-arboricity of toroidal graphs (Q1714033) (← links)
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable (Q1934390) (← links)
- On linear 2-arboricity of certain graphs (Q2101974) (← links)
- A structural theorem for planar graphs with some applications (Q2275921) (← links)
- Light structures in 1-planar graphs with an application to linear 2-arboricity (Q2322876) (← links)
- On group choosability of total graphs (Q2376095) (← links)
- Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles (Q2376098) (← links)
- On the linear 2-arboricity of planar graph without normally adjacent 3-cycles and 4-cycles (Q4976301) (← links)
- The linear 2-arboricity of 1-planar graphs without 3-cycles (Q5025157) (← links)
- The linear 2-arboricity of sparse graphs (Q5370820) (← links)
- The linear 2-arboricity of IC-planar graphs (Q6166036) (← links)
