Interval vertex-coloring of a graph with forbidden colors
From MaRDI portal
Publication:1823960
DOI10.1016/0012-365X(89)90204-5zbMATH Open0682.05033MaRDI QIDQ1823960FDOQ1823960
Authors: Marek Kubale 
Publication date: 1989
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Interval edge coloring of a graph with forbidden colors
- INTERVAL VERTEX-COLORINGS OF CACTUS GRAPHS WITH RESTRICTIONS ON VERTICES
- Interval non-total colorable graphs
- Vertex colourings of multigraphs with forbiddances on edges
- Intervalizing \(k\)-colored graphs
- Interval edge-colorings of complete graphs
- Forbidden subgraphs of coloring graphs
- Coloring graphs with forbidden induced subgraphs
- scientific article; zbMATH DE number 17824
- Coloring graphs characterized by a forbidden subgraph
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scheduling unit-time tasks with integer release times and deadlines
- On the Complexity of Timetable and Multicommodity Flow Problems
- The complexity of scheduling independent two-processor tasks on dedicated processors
- Computing and Combinatorics
- The NP-completeness column: An ongoing guide
- On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals
- Title not available (Why is that?)
Cited In (13)
- Precoloring extension. I: Interval graphs
- Comparison of neural and heuristic methods for a timetabling problem
- Interval edge coloring of a graph with forbidden colors
- Preassignment requirements in chromatic scheduling
- Title not available (Why is that?)
- INTERVAL VERTEX-COLORINGS OF CACTUS GRAPHS WITH RESTRICTIONS ON VERTICES
- A broken cycle theorem for the restrained chromatic function
- About equivalent interval colorings of weighted graphs
- Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
- Some results concerning the complexity of restricted colorings of graphs
- Restraints permitting the largest number of colourings
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
- Tree-coloring problems of bounded treewidth graphs
This page was built for publication: Interval vertex-coloring of a graph with forbidden colors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823960)
