Equitable Coloring
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A note on equitable colorings of forests
- Equitable and proportional coloring of trees
- A sufficient condition for equitable edge-colourings of simple graphs
- Equitable coloring and equitable choosability of graphs with small maximum average degree
- \((N, p)\)-equitable \(b\)-coloring of graphs
- A flow based pruning scheme for enumerative equitable coloring algorithms
- A new lower bound for the chromatic number of general Kneser hypergraphs
- Total equitable list coloring
- Virtually fibering random right-angled Coxeter groups -- extended abstract
- Equitable coloring of some convex polytope graphs
- On equitable coloring of bipartite graphs
- Equitable colorings of planar graphs without short cycles
- A note on relaxed equitable coloring of graphs
- Equivalence of two conjectures on equitable coloring of graphs
- Equitable partition of planar graphs
- A note on the equitable choosability of complete bipartite graphs
- Equitable total coloring of corona of cubic graphs
- On list equitable total colorings of the generalized theta graph
- Proportional 2-choosability with a bounded palette
- Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy
- On the equitable choosability of the disjoint union of stars
- Star colouring of bounded degree graphs and regular graphs
- Improving lower bounds for equitable chromatic number
- Equitable distinguishing chromatic number
- A simple characterization of proportionally 2-choosable graphs
- Equitable partitions into matchings and coverings in mixed graphs
- Tree-coloring problems of bounded treewidth graphs
- Proportional choosability: a new list analogue of equitable coloring
- Equitable total-coloring of subcubic graphs
- Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles
- Equitable colorings of corona multiproducts of graphs
- Equitable vertex arboricity of 5-degenerate graphs
- Equitable coloring of hypergraphs
- A polyhedral approach for the equitable coloring problem
- The equitable total chromatic number of the graph \(\mathrm{HM}(W_n)\)
- Equitable coloring planar graphs with large girth
- Proportional choosability of complete bipartite graphs
- On the equitable vertex arboricity of complete tripartite graphs
- A branch-and-cut algorithm for equitable coloring based on a formulation by representatives
- Polyhedral results for the equitable coloring problem
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
- On equitable colouring of Knödel graphs
- A survey of graph coloring -- its types, methods and applications
- A tabu search heuristic for the equitable coloring problem
- Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
- A DSATUR-based algorithm for the equitable coloring problem
- Equitable coloring of 2-degenerate graph and plane graphs without cycles of specific lengths
- Monadic Second Order Logic on Graphs with Local Cardinality Constraints
- Equitable and list equitable colorings of planar graphs without 4-cycles
- Equitable vertex arboricity of graphs
- On r-equitable chromatic threshold of Kronecker products of complete graphs
- Equitable \(\Delta\)-coloring of graphs
- Equitable coloring parameters of certain graph classes
- An algorithmic approach to equitable total chromatic number of graphs
- Equitable colorings of Cartesian products with balanced complete multipartite graphs
- On \(b\)-chromatic number with other types of chromatic numbers on double star graphs
- The equitable vertex arboricity of complete tripartite graphs
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
- Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
- Coloring the square of Sierpiński graphs
- On equitable list arboricity of graphs
- On equitable coloring of corona of wheels
- Equitable fair domination in graphs
- Equitable chromatic number of weak modular product of some graphs
- On equitable coloring of extented corona of some graphs
- EQUITABLE CHROMATIC NUMBER OF SOME WHEEL RELATED GRAPHS
- scientific article; zbMATH DE number 7527888 (Why is no real title available?)
- On equitable coloring of book graph families
- Equitable edge coloring on tensor product of graphs
- Equitable edge chromatic number of \(P_m\otimes S_n^0\) and \(S_m^0\otimes S_n^0\)
- On equitable chromatic number of tadpole graph \(t_{m,n}\)
- Equitable list vertex colourability and arboricity of grids
- On locally-balanced 2-partitions of some classes of graphs
- On locally-balanced 2-partitions of bipartite graphs
- LOCALLY-BALANCED k-PARTITIONS OF GRAPHS
- _e-graphs of graphs
- On equitable and equitable list colorings of series-parallel graphs
- On certain parameters of equitable coloring of graphs
- Equitable coloring on total graph of bigraphs and central graph of cycles and paths
- Equitably strong non-split equitable domination in graphs
- On the equitable chromatic number of complete \(n\)-partite graphs
- Equitable colorings of Kronecker products of graphs
- Equitable and equitable list colorings of graphs
- Equitable oriented coloring
- Equitable critical graphs
- Injectively \(k\)-colored rooted forests
- Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization
- A STUDY ON EQUITABLE CHROMATIC AND THRESHOLD OF MYCIELSKIAN OF GRAPHS
- New results on the robust coloring problem
- A notion of vertex equitability for proper labellings
- Secure equitability in graphs
- Extremal numbers for disjoint copies of a clique
- On the complexity of some colorful problems parameterized by treewidth
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
- Equitable and m-bounded coloring of split graphs
- Equitable colorings of \(l\)-corona products of cubic graphs
- Equitable coloring in 1-planar graphs
- Further studies on chromatic completion of graphs
- Equitable list coloring of sparse graphs
This page was built for publication: Equitable Coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4404923)