Cover Image

Proper colorings of a graph in linear time using a number of colors linear in the maximum degree of the graph

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bhandari, Kritika, Huber, Mark
Format:	Preprint
Published:	2025
Subjects:	Probability Computational Complexity Data Structures and Algorithms 60-08, 05C85 F.2.2; G.3; G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations
by: Bougeret, Marin, et al.
Published: (2024)

Kernelization dichotomies for hitting minors under structural parameterizations
by: Bougeret, Marin, et al.
Published: (2025)

Low-degree spanning trees of $2$-edge-connected graphs in linear time
by: Dereniowski, Dariusz, et al.
Published: (2024)

Finding Diverse Minimum s-t Cuts
by: de Berg, Mark, et al.
Published: (2023)

Realizing temporal graphs from fastest travel times
by: Klobas, Nina, et al.
Published: (2023)

How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length
by: Huber, Michael Kiran
Published: (2024)

Exploration of $k$-edge-deficient temporal graphs in linear time
by: Lahtin, Ivan, et al.
Published: (2026)

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time
by: Gartland, Peter, et al.
Published: (2023)

Shortest two disjoint paths in conservative graphs
by: Schlotter, Ildikó
Published: (2023)

Identification to Subclasses of Chordal Graphs
by: Golovach, Petr A., et al.
Published: (2026)

On modeling NP-Complete problems as polynomial-sized linear programs: Escaping/Side-stepping the "barriers"
by: Diaby, Moustapha, et al.
Published: (2023)

On the parameterized complexity of computing good edge-labelings
by: de Andrade, Davi, et al.
Published: (2024)

Finding irrelevant vertices in linear time on bounded-genus graphs
by: Golovach, Petr A., et al.
Published: (2019)

Graph Threading with Turn Costs
by: Demaine, Erik D., et al.
Published: (2024)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
by: Dvořák, Pavel, et al.
Published: (2017)

A Piecewise Approach for the Analysis of Exact Algorithms
by: Clinch, Katie, et al.
Published: (2024)

An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors
by: De Meyer, Lucas, et al.
Published: (2025)

Better coloring of 3-colorable graphs
by: Kawarabayashi, Ken-ichi, et al.
Published: (2024)

Temporalizing digraphs via linear-size balanced bi-trees
by: Bessy, Stéphane, et al.
Published: (2023)

A New Temporal Interpretation of Cluster Editing
by: Bocci, Cristiano, et al.
Published: (2022)

Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
by: Masařík, Tomáš, et al.
Published: (2026)

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
by: Krishnaswamy, Ravishankar, et al.
Published: (2014)

Reconstruction of Line-Embeddings of Graphons
by: Janssen, Jeannette, et al.
Published: (2020)

A polynomial-time algorithm for recognizing high-bandwidth graphs
by: Varona, Luis M. B.
Published: (2026)

NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
by: Fairbairn, David L., et al.
Published: (2024)

Cluster deletion and clique partitioning in graphs with bounded clique number
by: Galesi, Nicola, et al.
Published: (2025)

Tree-independence number VI. Thetas and pyramids
by: Chudnovsky, Maria, et al.
Published: (2025)

Large cliques and large independent sets: can they coexist?
by: Feige, Uriel, et al.
Published: (2025)

Traffic-Oblivious Multi-Commodity Flow Network Design
by: Chimani, Markus, et al.
Published: (2025)

Exact Algorithms for MaxCut on Split Graphs
by: Lalovic, Marko
Published: (2024)

When Votes Change and Committees Should (Not)
by: Bredereck, Robert, et al.
Published: (2020)

Structural Parameterization of Steiner Tree Packing
by: Hastrich, Niko, et al.
Published: (2025)

Fast and Simple Sorting Using Partial Information
by: Haeupler, Bernhard, et al.
Published: (2024)

JFR: An Efficient Jump Frontier Relaxation Strategy for Bellman-Ford
by: Wang, Xin, et al.
Published: (2025)

Customizable Contraction Hierarchies -- A Survey
by: Bläsius, Thomas, et al.
Published: (2025)

Maintaining Routing Structures under Deletions via Self-Pruning
by: Haeupler, Bernhard, et al.
Published: (2025)

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
by: Haeupler, Bernhard, et al.
Published: (2023)

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
by: Balzotti, Lorenzo
Published: (2020)

Near-Linear Time Computation of Welzl Orders on Graphs with Linear Neighborhood Complexity
by: Dreier, Jan, et al.
Published: (2026)

Bidirectional Dijkstra's Algorithm is Instance-Optimal
by: Haeupler, Bernhard, et al.
Published: (2024)