scientific article; zbMATH DE number 7378731
From MaRDI portal
Publication:5009627
DOI10.4230/LIPIcs.ESA.2018.61MaRDI QIDQ5009627
Daniël Paulusma, Erik Jan van Leeuwen, Barnaby Martin
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1803.03663
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of surjective homomorphism problems-a survey
- The external constraint 4 nonempty part sandwich problem
- \(2K_{2}\) vertex-set partition into nonempty parts
- Covering graphs with few complete bipartite subgraphs
- List homomorphisms to reflexive graphs
- Linear-time recognition of circular-arc graphs
- \(2K_2\)-partition of some classes of graphs
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- The computational complexity of disconnected cut and \(2 K_2\)-partition
- On disconnected cuts and separators
- Graph partitions with prescribed patterns
- Domination When the Stars Are Out
- Algorithms for Partition of Some Class of Graphs under Compaction
- A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More)
- Bounding χ in terms of ω and Δ for quasi-line graphs
- Parameterizing Cut Sets in a Graph by the Number of Their Components
- Contractibility and NP-completeness
- List Partitions
- Solving the all-pair shortest path query problem on interval and circular-arc graphs
- Minimal disconnected cuts in planar graphs
- FindingH-partitions efficiently
- Computational Complexity of Compaction to Reflexive Cycles
- Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs
- Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition
This page was built for publication:
