S-functions for graphs
From MaRDI portal
Cites work
- Bemerkungen zu Hadwigers Vermutung
- Beweis einer Abschwächung der Hadwiger-Vermutung
- Homomorphiebasen von Graphenmengen
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3311627 (Why is no real title available?)
- scientific article; zbMATH DE number 3102312 (Why is no real title available?)
- On Independent Circuits Contained in a Graph
- Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner
Cited in
(99)- Linear connectivity forces large complete bipartite minors
- A note on partial 3-trees and homomorphism bases of graphs
- Pushdown reachability with constant treewidth
- Track layouts, layered path decompositions, and leveled planarity
- Directed tree-width
- Compatibility, desirability, and the running intersection property
- Complete-subgraph-transversal-sets problem on bounded treewidth graphs
- Faster algorithms for quantitative verification in bounded treewidth graphs
- The complexity of the vertex-minor problem
- Upper and lower degree-constrained graph orientation with minimum penalty
- New limits of treewidth-based tractability in optimization
- Treewidth of the generalized Kneser graphs
- A new approach on locally checkable problems
- Adapting the directed grid theorem into an \textsf{FPT} algorithm
- Treewidth and gonality of glued grid graphs
- Treewidth is a lower bound on graph gonality
- An improvement of Reed's treewidth approximation
- Finite reflection groups and graph norms
- Layered separators in minor-closed graph classes with applications
- The lexicographic product of some chordal graphs and of cographs preserves b-continuity
- \(K_{6}\) minors in 6-connected graphs of bounded tree-width
- Grad and classes with bounded expansion. I: Decompositions
- Grad and classes with bounded expansion. II: Algorithmic aspects
- On the complexity of planning for agent teams and its implications for single agent planning
- The mixed search game against an agile and visible fugitive is monotone
- On strict brambles
- Two approaches to Sidorenko's conjecture
- Integrating and sampling cuts in bounded treewidth graphs
- On modal -calculus over finite graphs with small components or small tree width
- On strong tree-breadth
- Track layout is hard
- Parameters tied to treewidth
- Posets with cover graph of pathwidth two have bounded dimension
- Simple monadic theories and partition width
- Burning two worlds
- Bidimensionality and kernels
- Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem
- The disjoint paths problem in quadratic time
- Tree-width of hypergraphs and surface duality
- On shortest disjoint paths in planar graphs
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Parameterized leaf power recognition via embedding into graph products
- The treewidth of 2-section of hypergraphs
- On the advice complexity of the \(k\)-server problem under sparse metrics
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
- An improvement of Reed's treewidth approximation
- Properties of large 2-crossing-critical graphs
- Adapting the directed grid theorem into an FPT algorithm
- VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY
- Provably shorter regular expressions from finite automata
- The behavior of clique-width under graph operations and graph transformations
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
- On the treewidth of random geometric graphs and percolated grids
- On treewidth and related parameters of random geometric graphs
- Structure of graphs with locally restricted crossings
- Exact distance oracles for planar graphs
- Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
- Self-avoiding walks and multiple context-free languages
- Clustered 3-colouring graphs of bounded degree
- On tripartite common graphs
- Properties of graphs specified by a regular language
- On the generalised colouring numbers of graphs that exclude a fixed minor
- Algorithmic uses of the Feferman-Vaught theorem
- Spined categories: generalizing tree-width beyond graphs
- Treelength of series-parallel graphs
- Edge-treewidth: algorithmic and combinatorial properties
- Monoidal Width
- Excluding a planar matching minor in bipartite graphs
- Monoidal Width: Capturing Rank Width
- Characterizing and generalizing cycle completable graphs
- Locating Eigenvalues of Symmetric Matrices - A Survey
- Eulerian Spaces
- An improved parameterized algorithm for treewidth
- A finite presentation of graphs of treewidth at most three
- Self-avoiding walk is ballistic on graphs with more than one end
- Rectilinear crossing number of graphs excluding a single-crossing graph as a minor
- Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. I: Algorithmic results
- Excluding a clique or a biclique in graphs of bounded induced matching treewidth
- Grid minors and products
- Efficient diagonalization of symmetric matrices associated with graphs of small treewidth
- Simultaneous separation in bounded degree trees
- Tree decompositions meet induced matchings: beyond max weight independent set
- Forest Expression of Networks and their Applications
- A dichotomy theorem for linear time homomorphism orbit counting in bounded degeneracy graphs
- Structure-guided automated reasoning
- Clustered independence and bounded treewidth
- Tree decompositions meet induced matchings: beyond max weight independent set
- Fast Gaussian elimination for low treewidth matrices
- A linear-delay algorithm for enumerating strongly-connected induced subgraphs based on SSD set system
- Induced matching treewidth and tree-independence number, revisited
- The parameter report: an orientation guide for data-driven parameterization
- Juggrnaut: using graph grammars for abstracting unbounded heap structures
- Parameterized leaf power recognition via embedding into graph products
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph
- Some recent progress and applications in graph minor theory
- Tensor network contractions for \#SAT
- Tree-chromatic number
- Interdiction problems on planar graphs
- Directed NLC-width
This page was built for publication: S-functions for graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1230790)
