Pages that link to "Item:Q2346331"
From MaRDI portal
The following pages link to \(d\)-strong total colorings of graphs (Q2346331):
Displaying 11 items.
- Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound (Q383771) (← links)
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164) (← links)
- \(d\)-strong edge colorings of graphs (Q2441359) (← links)
- Distant set distinguishing total colourings of graphs (Q2629496) (← links)
- 当24≤d≤34时圈的d-强全染色 (Q2984404) (← links)
- \(d\)-strong total colorings of cycles when \(35\leq d\leq 55\) (Q2992660) (← links)
- (Q3166098) (← links)
- (Q3421917) (← links)
- Strongly set-colorable graphs (Q4621304) (← links)
- Strong k-colourings of graphs (Q4809513) (← links)
- STRONG COLORINGS OVER PARTITIONS (Q5009680) (← links)