Pages that link to "Item:Q3972105"
From MaRDI portal
The following pages link to Some extremal results concerning the number of graph and hypergraph colorings (Q3972105):
Displaying 12 items.
- Extremal \(H\)-colorings of trees and 2-connected graphs (Q345129) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)
- Maximizing the number of \(x\)-colorings of 4-chromatic graphs (Q1709544) (← links)
- On the maximum number of colorings of a graph (Q1750664) (← links)
- Extremal colorings and independent sets (Q1756103) (← links)
- Extremal triangle-free and odd-cycle-free colourings of uncountable graphs (Q2036604) (← links)
- New bounds for chromatic polynomials and chromatic roots (Q2352058) (← links)
- Maximal chromatic polynomials of connected planar graphs (Q3480061) (← links)
- On Some Extremal Properties of Hypergraph Colorings (Q3503457) (← links)
- Some extremal results in cochromatic and dichromatic theory (Q3984467) (← links)
- Some new bounds for the maximum number of vertex colorings of a (v,e)-graph (Q4242963) (← links)
- The Typical Structure of Gallai Colorings and Their Extremal Graphs (Q5204070) (← links)