scientific article; zbMATH DE number 3545685

MaRDI QIDQ4120593zbMATH OpenFDO

Authors Yuri N. Sotskov, Vyacheslav Tanaev

Publication date 1976

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Cited in

(12)

• Mixed graph edge coloring
• Tutte polynomials for directed graphs
• Parameterized mixed graph coloring
• On two coloring problems in mixed graphs
• A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach
• Some families of integral mixed graphs
• A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring
• Coloring mixed and directional interval graphs
• Mixed graph colouring as scheduling multi-processor tasks with equal processing times
• Coloring and recognizing mixed interval graphs
• A mathematical approach on representation of competitions: competition cluster hypergraphs
• Coloring some classes of mixed graphs

This page was built for publication:

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