Bounded vertex colorings of graphs
From MaRDI portal
Recommendations
Cites work
- Chromatic optimisation: Limitations, objectives, uses, references
- Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
- Critical perfect graphs and perfect 3-chromatic graphs
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- Normal hypergraphs and the perfect graph conjecture
- On Complementary Graphs
- On the completeness of a generalized matching problem
- Some uses of hypergraphs in timetabling
- Two-Processor Scheduling with Start-Times and Deadlines
Cited in
(39)- Graph coloring with cardinality constraints on the neighborhoods
- Restricted coloring models for timetabling
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- Bounds for mean colour numbers of graphs
- What are the worst cases in constrained last-in-first-out pick-up and delivery problems?
- Scheduling jobs on identical machines with agreement graph
- Heuristics and lower bounds for the bin packing problem with conflicts
- Near-complete multipartite graphs and forbidden induced subgraphs
- An Erdős-Gallai type theorem for vertex colored graphs
- The prisoner transportation problem
- Bounded colouring motivated by the limited resource partially concurrent open shop problem
- Coloring hypergraphs with bounded cardinalities of edge intersections
- Clique partitioning with value-monotone submodular cost
- An overview of curriculum-based course timetabling
- Equitable coloring of hypergraphs
- Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees
- Batch processing with interval graph compatibilities between tasks
- Mutual exclusion scheduling with interval graphs or related classes. II
- A survey on vertex coloring problems
- Bounded Max-colorings of Graphs
- Bounds on vertex colorings with restrictions on the union of color classes
- Locally boundedk-colorings of trees
- Some new bounds for the maximum number of vertex colorings of a (v,e)-graph
- Coloration de graphes : fondements et applications
- Degree‐bounded coloring of graphs: Variations on a theme by brooks
- On equitable chromatic number of tadpole graph \(t_{m,n}\)
- A study of the boundary graph classes for colorability problems
- Bounded colorings of outerplanar graphs
- Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
- Bounded vertex coloring of trees
- Scheduling with machine conflicts
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
- A note on the \(m\)-bounded chromatic number of a tree
- Concurrency constrained scheduling with tree-like constraints
- Vertex-colored encompassing graphs
- Equitable colorings of bounded treewidth graphs
- Scheduling with conflicts: Online and offline algorithms
- Partitioning a weighted partial order
- A tutorial on the use of graph coloring for some problems in robotics
This page was built for publication: Bounded vertex colorings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686481)
