scientific article; zbMATH DE number 3545685

zbMATH Open0351.05106MaRDI QIDQ4120593FDOQ4120593

Authors: Yuri N. Sotskov, Vyacheslav Tanaev 

Publication date: 1976

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (11)

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

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)