Mixed graph colorings

DOI10.1007/BF01194253MaRDI QIDQ1360876zbMATH OpenOpenAlexFDO

Authors 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 numberchromatic schedulingmixed graphoriented graphstrees

Mathematics Subject Classification ID

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

Recommendations

• On two coloring problems in mixed graphs
• Coloring some classes of mixed graphs
• The edge chromatic number of a directed/mixed multigraph
• Mixed graph edge coloring

Cites work

• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 3205929 (Why is no real title available?)
• scientific article; zbMATH DE number 3257176 (Why is no real title available?)
• scientific article; zbMATH DE number 3404264 (Why is no real title available?)
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• Min-max heaps and generalized priority queues
• Nombre chromatique et plus longs chemins d'un graphe

Cited in

(23)

• Using stable sets to bound the chromatic number
• Mixed graph edge coloring
• On a multiconstrained model for chromatic scheduling
• Parameterized mixed graph coloring
• On two coloring problems in mixed graphs
• Vyacheslav Tanaev: contributions to scheduling and related areas
• Scheduling Problems and Mixed Graph Colorings
• Mixing 3-Colourings in Bipartite Graphs
• scientific article; zbMATH DE number 3924810 (Why is no real title available?)
• Coloration de graphes : fondements et applications
• On weak chromatic polynomials of mixed graphs
• scientific article; zbMATH DE number 7536080 (Why is no real title available?)
• A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring
• Coloring mixed and directional interval graphs
• Turán problems for mixed graphs
• Mixed graph colouring as scheduling multi-processor tasks with equal processing times
• Applications of mixed fuzzy graph colouring in traffic signal optimization and supply chain management
• Coloring and recognizing mixed interval graphs
• Coloring some classes of mixed graphs
• Using mixed graph coloring to minimize total completion time in job shop scheduling
• Mixed hypergraphs and other coloring problems
• A note on mixed tree coloring
• Complexity of two coloring problems in cubic planar bipartite mixed graphs

This page was built for publication: Mixed graph colorings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1360876)