Pages that link to "Item:Q3535837"
From MaRDI portal
The following pages link to Chromatic number, independence ratio, and crossing number (Q3535837):
Displayed 34 items.
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- Cyclic colorings of plane graphs with independent faces (Q661937) (← links)
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs (Q1702255) (← links)
- Neighbor sum distinguishing total coloring of sparse IC-planar graphs (Q1706133) (← links)
- The structure of plane graphs with independent crossings and its applications to coloring problems (Q1935605) (← links)
- Neighbor sum distinguishing total coloring of triangle free IC-planar graphs (Q1987570) (← links)
- Acyclic edge coloring of IC-planar graphs (Q2023729) (← links)
- The maximal 1-planarity and crossing numbers of graphs (Q2042209) (← links)
- A sufficient condition for an IC-planar graph to be class 1 (Q2053694) (← links)
- Adjacent vertex distinguishing edge coloring of IC-planar graphs (Q2136165) (← links)
- Neighbor sum distinguishing total coloring of IC-planar graphs (Q2185920) (← links)
- An improved upper bound for the acyclic chromatic number of 1-planar graphs (Q2192086) (← links)
- On \((p, 1)\)-total labelling of NIC-planar graphs (Q2239035) (← links)
- Neighbor sum distinguishing total choosability of IC-planar graphs (Q2282486) (← links)
- Remarks on the joins of 1-planar graphs (Q2286052) (← links)
- Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 (Q2292143) (← links)
- Linear arboricity of NIC-planar graphs (Q2300535) (← links)
- Equitable partition of plane graphs with independent crossings into induced forests (Q2305905) (← links)
- Acyclic coloring of IC-planar graphs (Q2329208) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- \(\mathsf{NIC}\)-planar graphs (Q2410219) (← links)
- Fan-crossing free graphs and their relationship to other beyond-planar graphs (Q2663047) (← links)
- \((k,p)\)-planarity: a relaxation of hybrid planarity (Q2664946) (← links)
- On morphing 1-planar drawings (Q2672443) (← links)
- Coloring plane graphs with independent crossings (Q3055915) (← links)
- Recognizing IC-Planar and NIC-Planar Graphs (Q4566013) (← links)
- IC-Planar Graphs Are 6-Choosable (Q5009330) (← links)
- Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles (Q5071596) (← links)
- (Q5089197) (← links)
- Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity (Q5141643) (← links)
- IC-planar graphs are odd-10-colorable (Q6160615) (← links)
- The linear 2-arboricity of IC-planar graphs (Q6166036) (← links)
- (Q6179340) (← links)
- (Q6188647) (← links)