Coloring temporal graphs
From MaRDI portal
Publication:2237899
DOI10.1016/j.jcss.2021.08.004zbMath1472.68117OpenAlexW3196572318MaRDI QIDQ2237899
Publication date: 28 October 2021
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2021.08.004
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A counterexample to the Alon-Saks-Seymour conjecture and related problems
- Parsimonious flooding in dynamic graphs
- A simplified NP-complete satisfiability problem
- Graph minors. III. Planar tree-width
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- Graph minors. V. Excluding a planar graph
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- All structured programs have small tree width and good register allocation
- Treewidth. Computations and approximations
- Choosability and fractional chromatic numbers
- The list chromatic index of a bipartite multigraph
- Sliding window temporal graph coloring
- Graph stories in small area
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- On temporal graph exploration
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
- Exploration of Periodically Varying Graphs
- The NP-completeness column: an ongoing guide
- The NP-Completeness of Edge-Coloring
- The biparticity of a graph
- Choice Numbers of Graphs: a Probabilistic Approach
- New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
- Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data
- On the Size and the Approximability of Minimum Temporally Connected Subgraphs
- Reducibility among Combinatorial Problems
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
- Node-and edge-deletion NP-complete problems
- Parameterized Algorithms
- On the Addressing Problem for Loop Switching
- k-Components, Clusters and Slicings in Graphs
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- An Introduction to Temporal Graphs: An Algorithmic Perspective*
- Temporal graph classes: a view through temporal separators
This page was built for publication: Coloring temporal graphs
