Pages that link to "Item:Q345129"
From MaRDI portal
The following pages link to Extremal \(H\)-colorings of trees and 2-connected graphs (Q345129):
Displaying 14 items.
- Extremal trees with respect to number of \((A, B, 2 C)\)-edge colourings (Q327737) (← links)
- Maximum number of colourings: 4-chromatic graphs (Q777478) (← links)
- Extremal problems on detectable colorings of trees (Q952656) (← links)
- On an extremal problem for colored trees (Q1279875) (← links)
- Maximizing the number of \(x\)-colorings of 4-chromatic graphs (Q1709544) (← links)
- Maximizing and minimizing the number of generalized colorings of trees (Q1727776) (← links)
- Extremal colorings and independent sets (Q1756103) (← links)
- On the number of heterochromatic trees in nice and beautiful colorings of complete graphs (Q2062897) (← links)
- \(H\)-free coloring on graphs with bounded tree-width (Q2326574) (← links)
- (Q2971211) (← links)
- Maximizing <i>H</i>‐Colorings of Connected Graphs with Fixed Minimum Degree (Q4978445) (← links)
- Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs (Q4997140) (← links)
- Extremal <i>H</i>‐Colorings of Graphs with Fixed Minimum Degree (Q5251205) (← links)
- Extremal graphs for Widom-Rowlinson colorings in \(k\)-chromatic graphs (Q6660051) (← links)
