Image de couverture de livre

Online Graph Coloring for $k$-Colorable Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kawarabayashi, Ken-ichi, Yoneda, Hirotaka, Yoneda, Masataka
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms 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 for Graphs of Large Odd Girth
par: Yoneda, Hirotaka, et autres
Publié: (2026)

EPTAS for Hard Graph Cut Problems for Dense Graphs
par: Deguchi, Kaisei, et autres
Publié: (2026)

Exponential Time Approximation for Coloring 3-Colorable Graphs
par: Guruswami, Venkatesan, et autres
Publié: (2024)

Approximating Maximum Edge 2-Coloring by Normalizing Graphs
par: Mömke, Tobias, et autres
Publié: (2024)

Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs
par: Dudeja, Aditi, et autres
Publié: (2024)

Graph Coloring Below Guarantees via Co-Triangle Packing
par: Akmal, Shyan, et autres
Publié: (2025)

The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring
par: Inoue, Yuta, et autres
Publié: (2026)

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

Online Graph Balancing and the Power of Two Choices
par: Bansal, Nikhil, et autres
Publié: (2026)

Better coloring of 3-colorable graphs
par: Kawarabayashi, Ken-ichi, et autres
Publié: (2024)

Parameterized Saga of First-Fit and Last-Fit Coloring
par: Agrawal, Akanksha, et autres
Publié: (2024)

Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness
par: Antony, Dhanyamol, et autres
Publié: (2023)

Solving the List Coloring Problem through a Branch-and-Price algorithm
par: Lucci, Mauro, et autres
Publié: (2023)

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
par: Deligkas, Argyrios, et autres
Publié: (2025)

Stability in Graphs with Matroid Constraints
par: Fomin, Fedor V., et autres
Publié: (2024)

Graph Visualization for Blockchain Data
par: Dietl, Marcell, et autres
Publié: (2024)

Temporal Graph Realization With Bounded Stretch
par: Mertzios, George B., et autres
Publié: (2025)

Triangle Detection in H-Free Graphs
par: Abboud, Amir, et autres
Publié: (2025)

Distance-Preserving Graph Compression Techniques
par: Madani, Amirali, et autres
Publié: (2023)

Optimal Enumeration of Eulerian Trails in Directed Graphs
par: Bals, Ben, et autres
Publié: (2026)

Optimal Padded Decomposition For Bounded Treewidth Graphs
par: Filtser, Arnold, et autres
Publié: (2024)

FO and MSO Model Checking on Temporal Graphs
par: Döring, Michelle, et autres
Publié: (2026)

Tight Paths and Tight Pairs in Weighted Directed Graphs
par: Balcázar, José Luis
Publié: (2025)

Robust Graph Isomorphism, Quadratic Assignment and VC Dimension
par: Dahan, Anatole, et autres
Publié: (2026)

The Complexity of Temporal Vertex Cover in Small-Degree Graphs
par: Hamm, Thekla, et autres
Publié: (2022)

Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
par: Paul-Pena, Daniel, et autres
Publié: (2024)

Algorithmic Results for Weak Roman Domination Problem in Graphs
par: Paul, Kaustav, et autres
Publié: (2024)

(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
par: Gahlawat, Harmender, et autres
Publié: (2025)

A Finer View of the Parameterized Landscape of Labeled Graph Contractions
par: Mathur, Yashaswini, et autres
Publié: (2025)

Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
par: Abbasi, Ali, et autres
Publié: (2026)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
par: Wang, Chen, et autres
Publié: (2024)

Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs
par: Marx, Dániel, et autres
Publié: (2026)

One Color Makes All the Difference in the Tractability of Partial Coloring in Semi-Streaming
par: Das, Avinandan
Publié: (2026)

An algorithm with a delay of $\mathcal{O}(kΔ)$ for enumerating connected induced subgraphs of size $k$
par: Xiao, Chenglong, et autres
Publié: (2024)

Extending Ghouila-Houri's Characterization of Comparability Graphs to Temporal Graphs
par: Charbit, Pierre, et autres
Publié: (2025)

A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs
par: Paul-Pena, Daniel, et autres
Publié: (2022)

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
par: Carlson, Charlie, et autres
Publié: (2024)

Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity
par: Jain, Vishesh, et autres
Publié: (2026)

Fanciful Figurines flip Free Flood-It -- Polynomial-Time Miniature Painting on Co-gem-free Graphs
par: Rosenke, Christian, et autres
Publié: (2026)

Improved Streaming Algorithm for Fair $k$-Center Clustering
par: Guo, Longkun, et autres
Publié: (2025)