S-functions for graphs
From MaRDI portal
Publication:1230790
DOI10.1007/BF01917434zbMath0339.05108WikidataQ29543762 ScholiaQ29543762MaRDI QIDQ1230790
Publication date: 1976
Published in: Journal of Geometry (Search for Journal in Brave)
Related Items
Treewidth of the generalized Kneser graphs, Finite reflection groups and graph norms, Self-avoiding walks and multiple context-free languages, Clustered 3-colouring graphs of bounded degree, On tripartite common graphs, A new approach on locally checkable problems, Four Shorts Stories on Surprising Algorithmic Uses of Treewidth, A polynomial time algorithm to compute the connected treewidth of a series-parallel graph, Adapting the directed grid theorem into an \textsf{FPT} algorithm, Simple monadic theories and partition width, An Improvement of Reed’s Treewidth Approximation, Posets with cover graph of pathwidth two have bounded dimension, ON MODAL μ-CALCULUS OVER FINITE GRAPHS WITH SMALL COMPONENTS OR SMALL TREE WIDTH, Algorithmic uses of the Feferman-Vaught theorem, Properties of Large 2-Crossing-Critical Graphs, Layered separators in minor-closed graph classes with applications, Some recent progress and applications in graph minor theory, Pushdown reachability with constant treewidth, Treewidth and gonality of glued grid graphs, The lexicographic product of some chordal graphs and of cographs preserves \(b\)-continuity, Tensor network contractions for \#SAT, Structure of Graphs with Locally Restricted Crossings, Adapting the Directed Grid Theorem into an FPT Algorithm, Spined categories: generalizing tree-width beyond graphs, Treelength of series-parallel graphs, Edge-treewidth: algorithmic and combinatorial properties, Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem, Monoidal Width, \(K_{6}\) minors in 6-connected graphs of bounded tree-width, Tree-chromatic number, The disjoint paths problem in quadratic time, Interdiction problems on planar graphs, On Strong Tree-Breadth, Tree-width of hypergraphs and surface duality, The mixed search game against an agile and visible fugitive is monotone, Excluding a planar matching minor in bipartite graphs, Grad and classes with bounded expansion. I: Decompositions, Grad and classes with bounded expansion. II: Algorithmic aspects, Monoidal Width: Capturing Rank Width, Track Layout Is Hard, On strict brambles, Characterizing and generalizing cycle completable graphs, Locating Eigenvalues of Symmetric Matrices - A Survey, Eulerian Spaces, Treewidth is a lower bound on graph gonality, On shortest disjoint paths in planar graphs, Directed NLC-width, Parameters Tied to Treewidth, On the complexity of planning for agent teams and its implications for single agent planning, Practical algorithms for MSO model-checking on tree-decomposable graphs, Burning Two Worlds, An improvement of Reed's treewidth approximation, Track layouts, layered path decompositions, and leveled planarity, VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY, Parameterized Leaf Power Recognition via Embedding into Graph Products, On the advice complexity of the \(k\)-server problem under sparse metrics, Compatibility, desirability, and the running intersection property, On the generalised colouring numbers of graphs that exclude a fixed minor, The behavior of clique-width under graph operations and graph transformations, The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs, PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA, Properties of graphs specified by a regular language, Two approaches to Sidorenko’s conjecture, Complete-subgraph-transversal-sets problem on bounded treewidth graphs, Juggrnaut: using graph grammars for abstracting unbounded heap structures, Bidimensionality and Kernels, 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, Linear connectivity forces large complete bipartite minors, On the treewidth of random geometric graphs and percolated grids, Integrating and Sampling Cuts in Bounded Treewidth Graphs, Parameterized leaf power recognition via embedding into graph products, Directed tree-width, Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs, Unnamed Item, A note on partial 3-trees and homomorphism bases of graphs, The treewidth of 2-section of hypergraphs, On Treewidth and Related Parameters of Random Geometric Graphs, New limits of treewidth-based tractability in optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bemerkungen zu Hadwigers Vermutung
- Homomorphiebasen von Graphenmengen
- Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Beweis einer Abschwächung der Hadwiger-Vermutung
- On Independent Circuits Contained in a Graph
