S-functions for graphs
From MaRDI portal
Cites work
- 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?)
- Bemerkungen zu Hadwigers Vermutung
- Beweis einer Abschwächung der Hadwiger-Vermutung
- Homomorphiebasen von Graphenmengen
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- On Independent Circuits Contained in a Graph
- Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner
Cited in
(81)- Treewidth is a lower bound on graph gonality
- Directed NLC-width
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Self-avoiding walks and multiple context-free languages
- Layered separators in minor-closed graph classes with applications
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph
- Compatibility, desirability, and the running intersection property
- Finite reflection groups and graph norms
- Excluding a planar matching minor in bipartite graphs
- Algorithmic uses of the Feferman-Vaught theorem
- Track layouts, layered path decompositions, and leveled planarity
- The disjoint paths problem in quadratic time
- Tree-width of hypergraphs and surface duality
- On modal \(\mu \)-calculus over finite graphs with small components or small tree width
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
- Monoidal Width: Capturing Rank Width
- Adapting the directed grid theorem into an \textsf{FPT} algorithm
- Clustered 3-colouring graphs of bounded degree
- Linear connectivity forces large complete bipartite minors
- Track layout is hard
- Monoidal Width
- Properties of large 2-crossing-critical graphs
- A new approach on locally checkable problems
- Burning two worlds
- Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem
- The mixed search game against an agile and visible fugitive is monotone
- On treewidth and related parameters of random geometric graphs
- Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
- Exact distance oracles for planar graphs
- Posets with cover graph of pathwidth two have bounded dimension
- VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY
- Two approaches to Sidorenko's conjecture
- On the complexity of planning for agent teams and its implications for single agent planning
- Directed tree-width
- On tripartite common graphs
- Spined categories: generalizing tree-width beyond graphs
- On strong tree-breadth
- Treewidth of the generalized Kneser graphs
- Integrating and sampling cuts in bounded treewidth graphs
- Characterizing and generalizing cycle completable graphs
- Tensor network contractions for \#SAT
- Edge-treewidth: algorithmic and combinatorial properties
- Some recent progress and applications in graph minor theory
- Complete-subgraph-transversal-sets problem on bounded treewidth graphs
- A note on partial 3-trees and homomorphism bases of graphs
- Adapting the directed grid theorem into an FPT algorithm
- Tree-chromatic number
- Interdiction problems on planar graphs
- Grad and classes with bounded expansion. I: Decompositions
- Grad and classes with bounded expansion. II: Algorithmic aspects
- The treewidth of 2-section of hypergraphs
- Parameters tied to treewidth
- Provably shorter regular expressions from finite automata
- Locating Eigenvalues of Symmetric Matrices - A Survey
- Parameterized leaf power recognition via embedding into graph products
- An improvement of Reed's treewidth approximation
- Pushdown reachability with constant treewidth
- An improvement of Reed's treewidth approximation
- Eulerian Spaces
- On shortest disjoint paths in planar graphs
- Structure of graphs with locally restricted crossings
- On the treewidth of random geometric graphs and percolated grids
- Juggrnaut: using graph grammars for abstracting unbounded heap structures
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
- Faster algorithms for quantitative verification in bounded treewidth graphs
- The complexity of the vertex-minor problem
- Simple monadic theories and partition width
- Parameterized leaf power recognition via embedding into graph products
- New limits of treewidth-based tractability in optimization
- Treewidth and gonality of glued grid graphs
- An improved parameterized algorithm for treewidth
- \(K_{6}\) minors in 6-connected graphs of bounded tree-width
- On strict brambles
- On the advice complexity of the \(k\)-server problem under sparse metrics
- Properties of graphs specified by a regular language
- The lexicographic product of some chordal graphs and of cographs preserves \(b\)-continuity
- Bidimensionality and kernels
- Treelength of series-parallel graphs
- The behavior of clique-width under graph operations and graph transformations
- Upper and lower degree-constrained graph orientation with minimum penalty
- On the generalised colouring numbers of graphs that exclude a fixed minor
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)
