Pages that link to "Item:Q5954081"
From MaRDI portal
The following pages link to Acyclic colouring of 1-planar graphs (Q5954081):
Displaying 44 items.
- On edge colorings of 1-toroidal graphs (Q353624) (← links)
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system (Q391976) (← links)
- A note on 1-planar graphs (Q401145) (← links)
- On partitioning the edges of 1-plane graphs (Q501676) (← links)
- On \((p,1)\)-total labelling of 1-planar graphs (Q651281) (← links)
- List edge and list total coloring of 1-planar graphs (Q692658) (← links)
- Light edges in 3-connected 2-planar graphs with prescribed minimum degree (Q723598) (← links)
- Acyclic edge coloring of triangle-free 1-planar graphs (Q746958) (← links)
- An improved upper bound on the linear 2-arboricity of 1-planar graphs (Q831027) (← links)
- Coloring vertices and faces of locally planar graphs (Q855294) (← links)
- Acyclic coloring of graphs without bichromatic long path (Q889416) (← links)
- Light subgraphs in the family of 1-planar graphs with high minimum degree (Q1757981) (← links)
- Minimum feedback vertex set and acyclic coloring. (Q1853123) (← links)
- On edge colorings of \(1\)-planar graphs (Q1944052) (← links)
- Right angle crossing graphs and 1-planarity (Q1949102) (← links)
- Acyclic improper colouring of graphs with maximum degree 4 (Q2018890) (← links)
- An improved upper bound for the acyclic chromatic number of 1-planar graphs (Q2192086) (← links)
- Re-embedding a 1-plane graph for a straight-line drawing in linear time (Q2235768) (← links)
- Equitable partition of plane graphs with independent crossings into induced forests (Q2305905) (← links)
- Light structures in 1-planar graphs with an application to linear 2-arboricity (Q2322876) (← links)
- Acyclic coloring of IC-planar graphs (Q2329208) (← links)
- On total colorings of 1-planar graphs (Q2352360) (← links)
- Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles (Q2359808) (← links)
- Acyclic coloring of graphs of maximum degree five: nine colors are enough (Q2380043) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- Acyclic chromatic index of triangle-free 1-planar graphs (Q2409523) (← links)
- Every toroidal graph is acyclically 8-choosable (Q2440482) (← links)
- Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope (Q2826670) (← links)
- Right Angle Crossing Graphs and 1-Planarity (Q3223950) (← links)
- Planar graphs without 4-cycles are acyclically 6-choosable (Q3652536) (← links)
- Algorithms for 1-Planar Graphs (Q5001657) (← links)
- IC-Planar Graphs Are 6-Choosable (Q5009330) (← links)
- 1-平面图的结构性质及其在无圈边染色上的应用 (Q5017551) (← links)
- The linear 2-arboricity of 1-planar graphs without 3-cycles (Q5025157) (← links)
- Note on improper coloring of $1$-planar graphs (Q5206449) (← links)
- A Facility Coloring Problem in 1-D (Q5251636) (← links)
- Acyclic colorings of planar graphs (Q5905418) (← links)
- A polyhedral study of the acyclic coloring problem (Q5916097) (← links)
- 1-planar graphs are odd 13-colorable (Q6041551) (← links)
- All 2-planar graphs having the same spanning subgraph (Q6087085) (← links)
- Acyclic edge coloring of 1-planar graphs without 4-cycles (Q6137646) (← links)
- Hardness transitions and uniqueness of acyclic colouring (Q6145810) (← links)
- IC-planar graphs are odd-10-colorable (Q6160615) (← links)
- The vertex arboricity of 1-planar graphs (Q6616434) (← links)
