Mixed graph colorings

DOI10.1007/BF01194253zbMath0880.90072OpenAlexW2045159002MaRDI QIDQ1360876

Pierre Hansen, Julio Kuplinsky, Dominique de Werra

Publication date: 26 August 1997

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01194253

zbMATH Keywords

chromatic numbertreesoriented graphsmixed graphchromatic scheduling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)

Related Items

Coloration de graphes : fondements et applications, Coloring some classes of mixed graphs, Using mixed graph coloring to minimize total completion time in job shop scheduling, A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring, Unnamed Item, Parameterized mixed graph coloring, On two coloring problems in mixed graphs, Coloring mixed and directional interval graphs, Vyacheslav Tanaev: contributions to scheduling and related areas, On weak chromatic polynomials of mixed graphs, A note on mixed tree coloring, Complexity of two coloring problems in cubic planar bipartite mixed graphs, Using stable sets to bound the chromatic number, Mixed graph edge coloring, On a multiconstrained model for chromatic scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Min-max heaps and generalized priority queues
• Nombre chromatique et plus longs chemins d'un graphe
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm