EPFL Logo
fr|en
Login
Publication

Complexity of mixed graph coloring

Bernard Ries
2008
Journal paper
Abstract

In this note we consider two coloring problems in mixed graphs, i.e., graphs containing edges and arcs. We show that they are both NP\mathcal{NP}-complete in cubic planar bipartite graphs. This answers an open question from \cite{Ries2}.

Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Copyright © 2025 EPFL, all rights reserved

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.