The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
From MaRDI portal
Publication:2007724
DOI10.1016/j.tcs.2019.09.013zbMath1442.05168arXiv1705.09014OpenAlexW2778913481MaRDI QIDQ2007724
Publication date: 22 November 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.09014
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
Implementation of quantum walks on IBM quantum computers ⋮ Walking on vertices and edges by continuous-time quantum walk ⋮ Unnamed Item ⋮ A computational complexity comparative study of graph tessellation problems ⋮ Total tessellation cover: bounds, hardness, and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The staggered quantum walk model
- NP-completeness of edge-colouring some restricted graphs
- Geometric algorithms and combinatorial optimization
- The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3
- Partition-based discrete-time quantum walks
- Quantum walks: a comprehensive review
- Planar graphs of maximum degree seven are Class I
- Gridline graphs: A review in two dimensions and an extension to higher dimensions
- The icosahedron is clique divergent
- Algorithmic graph theory and perfect graphs
- Threshold graphs and related topics
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Chromatic index of graphs with no cycle with a unique chord
- The graph tessellation cover number: extremal bounds, efficient algorithms and hardness
- Vertex domination-critical graphs
- NP completeness of finding the chromatic index of regular graphs
This page was built for publication: The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
