Equitable list coloring of sparse graphs
From MaRDI portal
Cites work
- \(H\)-factors in dense graphs
- A list analogue of equitable coloring
- A note on equitable colorings of forests
- A refinement of a result of Corrádi and Hajnal
- Chromatic optimisation: Limitations, objectives, uses, references
- Equitable and proportional coloring of trees
- Equitable Coloring
- Equitable coloring and equitable choosability of graphs with small maximum average degree
- Equitable coloring and the maximum degree
- Equitable coloring of sparse planar graphs
- Equitable coloring of trees
- Equitable coloring planar graphs with large girth
- Equitable list coloring of graphs with bounded degree
- Equitable list coloring of planar graphs with given maximum degree
- Equitable list-coloring for graphs of maximum degree 3
- Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring
- Extremal graph packing problems: Ore-type versus Dirac-type
- Graph theory
- scientific article; zbMATH DE number 1640601 (Why is no real title available?)
- scientific article; zbMATH DE number 949303 (Why is no real title available?)
- scientific article; zbMATH DE number 1833421 (Why is no real title available?)
- scientific article; zbMATH DE number 871903 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- Large deviations for sums of partly dependent random variables
- Perfect Graphs and an Application to Optimizing Municipal Services
- Spanning subgraphs of random graphs
- The infamous upper tail
This page was built for publication: Equitable list coloring of sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6857906)
