Image de couverture de livre

Coloring and Recognizing Directed Interval Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gutowski, Grzegorz, Junosza-Szaniawski, Konstanty, Klesen, Felix, Rzążewski, Paweł, Wolff, Alexander, Zink, Johannes
Format:	Preprint
Publié:	2023
Sujets:	Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Online Coloring of Short Intervals
par: Chybowska-Sokół, Joanna, et autres
Publié: (2018)

Coloring Mixed and Directional Interval Graphs
par: Gutowski, Grzegorz, et autres
Publié: (2022)

Modelling Network Resilience: The Complexity of Some Graph Division Games
par: Gutowski, Grzegorz, et autres
Publié: (2026)

Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations
par: Firman, Oksana, et autres
Publié: (2024)

First-Fit Coloring of Forests in Random Arrival Model
par: Bosek, Bartłomiej, et autres
Publié: (2024)

Computing Height-Optimal Tangles Faster
par: Firman, Oksana, et autres
Publié: (2019)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
par: Pilipczuk, Marcin, et autres
Publié: (2023)

List coloring ordered graphs with forbidden induced subgraphs
par: Piecyk, Marta, et autres
Publié: (2025)

Polynomial-time recognition and maximum independent set in Burling graphs
par: Rzążewski, Paweł, et autres
Publié: (2024)

The Complexity of Finding Tangles
par: Firman, Oksana, et autres
Publié: (2020)

Induced matching treewidth and tree-independence number, revisited
par: Alon, Noga, et autres
Publié: (2025)

Hitting all longest paths in $H$-free graphs and $H$-graphs
par: de Lima, Paloma T., et autres
Publié: (2025)

Outerplanar and Forest Storyplans
par: Fiala, Jiří, et autres
Publié: (2023)

On Approximate MMS Allocations on Restricted Graph Classes
par: Blažej, Václav, et autres
Publié: (2025)

Complexity Aspects of Homomorphisms of Ordered Graphs
par: Čertík, Michal, et autres
Publié: (2025)

On Computational Aspects of Cores of Ordered Graphs
par: Čertík, Michal, et autres
Publié: (2025)

Clique-width and induced topological minors
par: Bieliński, Paweł Rafał, et autres
Publié: (2026)

The Parameterized Complexity of Coloring Mixed Graphs
par: Lauerbach, Antonio, et autres
Publié: (2026)

On coarse tree decompositions and coarse balanced separators
par: Abrishami, Tara, et autres
Publié: (2025)

On Computational Aspects of Ordered Matching Problems
par: Čertík, Michal, et autres
Publié: (2025)

Linear Layouts of Graphs with Priority Queues
par: Di Giacomo, Emilio, et autres
Publié: (2025)

Constant congestion brambles in directed graphs
par: Masařík, Tomáš, et autres
Publié: (2021)

Max Weight Independent Set in sparse graphs with no long claws
par: Abrishami, Tara, et autres
Publié: (2023)

Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete
par: la Tour, Max Dupré, et autres
Publié: (2025)

Tree-independence number of $P_5$-free graphs with no large bicliques
par: Blažej, Václav, et autres
Publié: (2026)

Drawing Trees and Cacti with Integer Edge Lengths on a Polynomial-Size Grid
par: Förster, Henry, et autres
Publié: (2025)

Multiset Metric Dimension of Binomial Random Graphs
par: Eide, Austin, et autres
Publié: (2025)

Interval Posets and Polygon Dissections
par: Bagno, Eli, et autres
Publié: (2024)

How to Color Temporal Graphs to Ensure Proper Transitions
par: Ibiapina, Allen, et autres
Publié: (2025)

A Complexity Dichotomy for Generalized Rainbow Matchings Based on Color Classes
par: Hommelsheim, Felix, et autres
Publié: (2026)

Mixed Unit Interval Bigraphs : A Characterization
par: Das, Ashok Kumar, et autres
Publié: (2026)

An $11/6$-Approximation Algorithm for Vertex Cover on String Graphs
par: Bonnet, Édouard, et autres
Publié: (2024)

Counting Colored Tilings on Grids and Graphs
par: Ramírez, José L., et autres
Publié: (2024)

On Local Limits of Sparse Random Graphs: Color Convergence and the Refined Configuration Model
par: Pluska, Alexander, et autres
Publié: (2025)

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
par: Bhyravarapu, Sriram, et autres
Publié: (2021)

Burling graphs in graphs with large chromatic number
par: Abrishami, Tara, et autres
Publié: (2025)

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
par: Majewski, Konrad, et autres
Publié: (2022)

Online Graph Coloring for $k$-Colorable Graphs
par: Kawarabayashi, Ken-ichi, et autres
Publié: (2025)

HyColor: An Efficient Heuristic Algorithm for Graph Coloring
par: Zhu, Enqiang, et autres
Publié: (2025)

Further Results and Questions on $S$-Packing Coloring of Subcubic Graphs
par: Mortada, Maidoun, et autres
Publié: (2024)