Pages that link to "Item:Q521761"
From MaRDI portal
The following pages link to Interval incidence coloring of subcubic graphs (Q521761):
Displaying 9 items.
- On the hardness of computing span of subcubic graphs (Q888955) (← links)
- On incidence coloring of complete multipartite and semicubic bipartite graphs (Q1692634) (← links)
- The incidence coloring conjecture for graphs of maximum degree 3 (Q1773364) (← links)
- On incidence choosability of cubic graphs (Q1999751) (← links)
- Interval incidence graph coloring (Q2255045) (← links)
- NP-completeness of 4-incidence colorability of semi-cubic graphs (Q2470012) (← links)
- Interval incidence coloring of bipartite graphs (Q2636801) (← links)
- SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS (Q3063603) (← links)
- Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs (Q3159395) (← links)