Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A note on the decomposition of graphs into isomorphic matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual exclusion scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2735585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable colorings of bounded treewidth graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4260373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrictions of graph partition problems. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of graph decomposition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The double traveling salesman problem with multiple stacks: A variable neighborhood search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: New neighborhood structures for the double traveling salesman problem with multiple stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of comparability graph recognition and coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded vertex colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mutual exclusion scheduling problem for permutation and comparability graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded vertex coloring of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The χt-coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existential problem of a weight-controlled subset and its application to school timetable construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic optimisation: Limitations, objectives, uses, references / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method for the double TSP with multiple stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stable set problem and the thinness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solutions to the double travelling salesman problem with multiple stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716273 / rank
 
Normal rank

Latest revision as of 19:13, 4 July 2024

scientific article
Language Label Description Also known as
English
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
scientific article

    Statements

    Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (English)
    0 references
    0 references
    0 references
    9 January 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references