Results 71 to 80 of about 2,549 (154)
Pathwidth of Circular-Arc Graphs [PDF]
, 2007 The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, there are extremely few graph classes for which pathwidh is known to be tractable in polynomial time.
Karol Suchan, Ioan Todinca
openaire +1 more source
Visibility Representations of Boxes in 2.5 Dimensions
, 2016 We initiate the study of 2.5D box visibility representations (2.5D-BR) where vertices are mapped to 3D boxes having the bottom face in the plane $z=0$ and edges are unobstructed lines of sight parallel to the $x$- or $y$-axis.
A Gupta +29 more
core +1 more source
2-Layer Graph Drawings with Bounded Pathwidth
Journal of Graph Algorithms and Applications, 2023 This paper determines which properties of 2-layer drawings characterise bipartite graphs of bounded pathwidth.
openaire +2 more sources
Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth [PDF]
, 2020 Christine T. Cheng, Will Rosenbaum
openalex +1 more source
On the pathwidth of chordal graphs
Discrete Applied Mathematics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
, 2017 An anagram is a word of the form $WP$ where $W$ is a non-empty word and $P$ is a permutation of $W$. We study anagram-free graph colouring and give bounds on the chromatic number. Alon et al.
Wilson, Tim E., Wood, David R.
core
Does Treewidth Help in Modal Satisfiability?
, 2010 Many tractable algorithms for solving the Constraint Satisfaction Problem (CSP) have been developed using the notion of the treewidth of some graph derived from the input CSP instance.
A. Herzig +24 more
core +1 more source
Minor-Closed Graph Classes with Bounded Layered Pathwidth [PDF]
, 2020 Vida Dujmović +4 more
openalex +1 more source
On the complexity of freezing automata networks of bounded pathwidth
, 2023 Eric Goles +3 more
openalex +2 more sources