The following pages link to (Q4846547):
Displaying 14 items.
- Edge coloring by total labelings of outerplanar graphs (Q381093) (← links)
- Equitable vertex arboricity of graphs (Q394205) (← links)
- On \(r\)-acyclic edge colorings of planar graphs (Q442224) (← links)
- Facial parity edge colouring of plane pseudographs (Q442406) (← links)
- Equitable and equitable list colorings of graphs (Q604470) (← links)
- Entire choosability of near-outerplane graphs (Q1025470) (← links)
- Choosability, edge choosability and total choosability of outerplane graphs (Q1840829) (← links)
- The clique-perfectness and clique-coloring of outer-planar graphs (Q2331588) (← links)
- The \(r\)-acyclic chromatic number of planar graphs (Q2343993) (← links)
- On group choosability of total graphs (Q2376095) (← links)
- Clique-transversal sets and clique-coloring in planar graphs (Q2441644) (← links)
- Labelling of some planar graphs with a condition at distance two (Q2454996) (← links)
- The entire coloring of series-parallel graphs (Q2577645) (← links)
- Edge-group choosability of outerplanar and near-outerplanar graphs (Q4997221) (← links)
