Coloring and recognizing mixed interval graphs

DOI10.4230/LIPICS.ISAAC.2023.36MaRDI QIDQ6953183zbMATH OpenFDO

Authors Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Paweł Rzążewski, Alexander Wolff, Johannes Zink

Publication date 24 July 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2023.36

zbMATH Keywords

graph coloringinterval graphsmixed graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A Linear Time Algorithm for Deciding Interval Graph Isomorphism
• A note on mixed tree coloring
• Coloring mixed and directional interval graphs
• scientific article; zbMATH DE number 3545685 (Why is no real title available?)
• scientific article; zbMATH DE number 782644 (Why is no real title available?)
• scientific article; zbMATH DE number 830382 (Why is no real title available?)
• Layered drawing of undirected graphs with generalized port constraints
• Mixed graph colorings
• Modular decomposition and transitive orientation
• On two coloring problems in mixed graphs
• On weak chromatic polynomials of mixed graphs
• Restricted coloring models for timetabling
• Scheduling Problems and Mixed Graph Colorings

This page was built for publication: Coloring and recognizing mixed interval graphs

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