The following pages link to Equitable coloring of trees (Q1328387):
Displaying 41 items.
- Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs (Q326469) (← links)
- A DSATUR-based algorithm for the equitable coloring problem (Q337479) (← links)
- Equitable and list equitable colorings of planar graphs without 4-cycles (Q389204) (← links)
- Equitable vertex arboricity of graphs (Q394205) (← links)
- On \(r\)-equitable chromatic threshold of Kronecker products of complete graphs (Q401157) (← links)
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (Q496694) (← links)
- Equitable coloring on total graph of bigraphs and central graph of cycles and paths (Q539352) (← links)
- Equitable colorings of Kronecker products of graphs (Q602760) (← links)
- Equitable and equitable list colorings of graphs (Q604470) (← links)
- Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs (Q741756) (← links)
- Equitable colorings of Cartesian products of graphs (Q765364) (← links)
- Equitable colorings of bounded treewidth graphs (Q817768) (← links)
- Equitable list colorings of planar graphs without short cycles (Q954980) (← links)
- A note on equitable colorings of forests (Q1024272) (← links)
- Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
- Every tree is 3-equitable (Q1567631) (← links)
- Equitable coloring and equitable choosability of graphs with small maximum average degree (Q1649917) (← links)
- \((N, p)\)-equitable \(b\)-coloring of graphs (Q1682874) (← links)
- On equitable coloring of bipartite graphs (Q1916388) (← links)
- Equitable total-coloring of subcubic graphs (Q2341763) (← links)
- Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles (Q2345542) (← links)
- Equitable coloring of hypergraphs (Q2414464) (← links)
- Twins in graphs (Q2441959) (← links)
- A polyhedral approach for the equitable coloring problem (Q2448876) (← links)
- The equitable total chromatic number of the graph \(\mathrm{HM}(W_n)\) (Q2454985) (← links)
- Equitable coloring planar graphs with large girth (Q2470470) (← links)
- Enumeration of equicolorable trees (Q2706191) (← links)
- On equitable coloring of central graphs and total graphs (Q2839223) (← links)
- On equitable colouring of Knödel graphs (Q2935368) (← links)
- Locally bounded<i>k</i>-colorings of trees (Q3621974) (← links)
- Equitable coloring parameters of certain graph classes (Q4554571) (← links)
- (Q4636249) (← links)
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms (Q4971668) (← links)
- On equitable coloring of corona of wheels (Q5006590) (← links)
- On certain parameters of equitable coloring of graphs (Q5370829) (← links)
- Structural parameterizations of budgeted graph coloring (Q5918737) (← links)
- Structural parameterizations of budgeted graph coloring (Q5925707) (← links)
- Equitable oriented coloring (Q6047973) (← links)
- Equitable critical graphs (Q6059092) (← links)
- Extremal numbers for disjoint copies of a clique (Q6202950) (← links)
- Equitable and \(m\)-bounded coloring of split graphs (Q6567664) (← links)
