Interval edge coloring of a graph with forbidden colors (Q1309462): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: List-colourings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on list-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Edge Coloring Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval vertex-coloring of a graph with forbidden colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results concerning the complexity of restricted colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3977503 / rank
 
Normal rank

Latest revision as of 11:01, 22 May 2024

scientific article
Language Label Description Also known as
English
Interval edge coloring of a graph with forbidden colors
scientific article

    Statements

    Interval edge coloring of a graph with forbidden colors (English)
    0 references
    0 references
    24 February 1994
    0 references
    interval coloring
    0 references
    bounds
    0 references
    NP-complete
    0 references
    complexity
    0 references
    polynomial-time algorithms
    0 references

    Identifiers