The following pages link to Bounded vertex colorings of graphs (Q686481):
Displaying 35 items.
- Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes (Q579241) (← links)
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- A note on the \(m\)-bounded chromatic number of a tree (Q685308) (← links)
- Vertex-colored encompassing graphs (Q742604) (← links)
- Equitable colorings of bounded treewidth graphs (Q817768) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Partitioning a weighted partial order (Q927191) (← links)
- A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
- Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
- Restricted coloring models for timetabling (Q1356739) (← links)
- The mutual exclusion scheduling problem for permutation and comparability graphs. (Q1401918) (← links)
- Bounds for mean colour numbers of graphs (Q1405125) (← links)
- What are the worst cases in constrained last-in-first-out pick-up and delivery problems? (Q1651694) (← links)
- Scheduling jobs on identical machines with agreement graph (Q1761988) (← links)
- Heuristics and lower bounds for the bin packing problem with conflicts (Q1765544) (← links)
- Near-complete multipartite graphs and forbidden induced subgraphs (Q1817577) (← links)
- An Erdős-Gallai type theorem for vertex colored graphs (Q2000563) (← links)
- The prisoner transportation problem (Q2178139) (← links)
- Bounded colouring motivated by the limited resource partially concurrent open shop problem (Q2241155) (← links)
- Partitioning graphs into induced subgraphs (Q2283104) (← links)
- Coloring hypergraphs with bounded cardinalities of edge intersections (Q2297713) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- An overview of curriculum-based course timetabling (Q2355018) (← links)
- Equitable coloring of hypergraphs (Q2414464) (← links)
- Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees (Q2420639) (← links)
- Batch processing with interval graph compatibilities between tasks (Q2476244) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. II (Q2476265) (← links)
- A survey on vertex coloring problems (Q3002686) (← links)
- Bounded Max-colorings of Graphs (Q3060747) (← links)
- Bounds on vertex colorings with restrictions on the union of color classes (Q3083409) (← links)
- Locally bounded<i>k</i>-colorings of trees (Q3621974) (← links)
- Some new bounds for the maximum number of vertex colorings of a (v,e)-graph (Q4242963) (← links)
- Coloration de graphes : fondements et applications (Q4809665) (← links)
- On equitable chromatic number of Tadpole graph T_{m,n} (Q5085729) (← links)
- A study of the boundary graph classes for colorability problems (Q5263795) (← links)
