A Note on Graphs with 2 Bends
Computational Complexity
2015-10-05 v1
Authors:
Martin Pergel
Abstract
We show NP-completeness for the recognition problem of 2-line-bend graphs.
Keywords
Cite
@article{arxiv.1510.00684,
title = {A Note on Graphs with 2 Bends},
author = {Martin Pergel},
journal= {arXiv preprint arXiv:1510.00684},
year = {2015}
}
Related papers
View all related →
Data Structures and Algorithms · Computer Science
Recognizing and Embedding Simple Optimal 2-Planar Graphs
Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou
2021-08-04
Combinatorics · Mathematics
On the achromatic number of signed graphs
Dimitri Lajou
2019-02-14
Computational Geometry · Computer Science
Recognition of Unit Segment and Polyline Graphs is $\exists\mathbb{R}$-Complete
Michael Hoffmann, Tillmann Miltzow, Simon Weber, Lasse Wulf
2025-12-09
Computational Complexity · Computer Science
Partitionability to two trees is NP-complete
Domotor Palvolgyi
2010-02-23
Computational Complexity · Computer Science
On the solution of the Graph Isomorphism Problem Part 1
Leonid Malinin, Natalia Malinina
2012-10-22
Computational Complexity · Computer Science
2-Colorable Perfect Matching is NP-complete in 2-Connected 3-Regular Planar Graphs
Erik D. Demaine, Kritkorn Karntikoon, Nipun Pitimanaaree
2023-09-19
Discrete Mathematics · Computer Science
On restrictions of balanced 2-interval graphs
Philippe Gambette, Stéphane Vialette
2008-02-04
Discrete Mathematics · Computer Science
The Graphs of Stably Matchable Pairs
David Eppstein
2020-10-20
Combinatorics · Mathematics
On Bivariegated Graphs and Line Graphs
Ranjan N. Naik
2025-08-08
Discrete Mathematics · Computer Science
On edge intersection graphs of paths with 2 bends
Martin Pergel, Paweł Rzążewski
2017-11-15
Information Theory · Computer Science
On the Complexity of finding Stopping Distance in Tanner Graphs
K. Murali Krishnan, Priti Shankar
2008-07-21
Combinatorics · Mathematics
On perfect k-matchings
Hongliang Lu
2010-08-26
Discrete Mathematics · Computer Science
On Covering a Graph Optimally with Induced Subgraphs
Shripad Thite
2007-05-23
Data Structures and Algorithms · Computer Science
Complexity dichotomy on partial grid recognition
Vinícius G. P. de Sá, Guilherme D. da Fonseca, Raphael Machado, Celina M. H. de Figueiredo
2012-04-13
Combinatorics · Mathematics
On Star Coloring of Splitting Graphs
Hanna Furmańczyk, Kowsalya V, Vernold Vivin J
2017-05-29
Discrete Mathematics · Computer Science
Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
Flavia Bonomo-Braberman, Gastón Abel Brito
2023-10-06
Combinatorics · Mathematics
Color-line and Proper Color-line Graphs
Van Bang Le, Florian Pfender
2019-06-10
Combinatorics · Mathematics
Edge-intersection graphs of grid paths: the bend-number
Daniel Heldt, Kolja Knauer, Torsten Ueckerdt
2012-08-21
Discrete Mathematics · Computer Science
On the complete width and edge clique cover problems
Van Bang Le, Sheng-Lung Peng
2016-12-28
Data Structures and Algorithms · Computer Science
Orienting Graphs to Optimize Reachability
S. L. Hakimi, E. Schmeichel, Neal E. Young
2015-06-02
Combinatorics · Mathematics
Some NP-complete edge packing and partitioning problems in planar graphs
Jed Yang
2014-09-09
Combinatorics · Mathematics
Finding bipartite subgraphs efficiently
D. Mubayi, G. Turan
2009-05-18
Machine Learning · Computer Science
Incomplete Graph Representation and Learning via Partial Graph Neural Networks
Bo Jiang, Ziyan Zhang
2021-06-07
Information Theory · Computer Science
Exact Graph Matching in Correlated Gaussian-Attributed Erd\H{o}s-R\'enyi Model
Joonhyuk Yang, Hye Won Chung
2024-07-18
Computational Complexity · Computer Science
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs
Sepp Hartung, André Nichterlein
2012-01-18