On Structural Parameterizations of Graph Motif and Chromatic Number
From MaRDI portal
Publication:2971640
DOI10.1007/978-3-319-53007-9_11zbMath1485.68115OpenAlexW2583353678MaRDI QIDQ2971640
Murali Krishna Enduri, I. Vinod Reddy, Neeldhara Misra, Bireswar Das
Publication date: 7 April 2017
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53007-9_11
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)
Related Items
Cites Work
- Between treewidth and clique-width
- Parameterized complexity of vertex colouring
- Threshold graphs and related topics
- Bin-packing and matchings in threshold graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- On the Kernelization Complexity of Colorful Motifs
- The Graph Motif Problem Parameterized by the Structure of the Input Graph
- Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
- Parameterized Algorithms
- Transitiv orientierbare Graphen
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item