Mixed graph colorings

Pierre Hansen, Julio Kuplinsky and Dominique Werra

Mathematical Methods of Operations Research, 1997, vol. 45, issue 1, 145-160

Abstract: A mixed graphG π contains both undirected edges and directed arcs. Ak-coloring ofG π is an assignment to its vertices of integers not exceedingk (also called colors) so that the endvertices of an edge have different colors and the tail of any arc has a smaller color than its head. The chromatic number γ π (G) of a mixed graph is the smallestk such thatG π admits ak-coloring. To the best of our knowledge it is studied here for the first time. We present bounds of γ(G), discuss algorithms to find this quantity for trees and general graphs, and report computational experience. Copyright Physica-Verlag 1997

Keywords: Graph coloring; oriented graphs; chromatic scheduling (search for similar items in EconPapers)
Date: 1997
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://hdl.handle.net/10.1007/BF01194253 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:45:y:1997:i:1:p:145-160

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/BF01194253

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().