Parameterized mixed graph coloring

DOI10.1007/s10878-019-00388-zzbMath1420.05054OpenAlexW2913961527WikidataQ128429807 ScholiaQ128429807MaRDI QIDQ2424815

Peter Damaschke

Publication date: 25 June 2019

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-019-00388-z

zbMATH Keywords

schedulinggraph coloringlongest pathmixed graphparameterized algorithm

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Coloring some classes of mixed graphs
• Using mixed graph coloring to minimize total completion time in job shop scheduling
• Complexity of two coloring problems in cubic planar bipartite mixed graphs
• The complexity of shop-scheduling problems with two or three jobs
• Mixed graph colorings
• On edge orienting methods for graph coloring
• On two coloring problems in mixed graphs
• The Parameterized Complexity of Oriented Colouring
• Solution of the Akers-Friedman Scheduling Problem
• Kernels: Annotated, Proper and Induced
• A Geometric Model and a Graphical Algorithm for a Sequencing Problem

This page was built for publication: Parameterized mixed graph coloring