scientific article
From MaRDI portal
Publication:3999150
zbMath0726.05001MaRDI QIDQ3999150
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Infinite graphs (05C63)
Related Items
Weak$^*$ closures and derived sets for convex sets in dual Banach spaces ⋮ Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial ⋮ Simplicial tree-decompositions of infinite graphs. I ⋮ Simplicial tree-decompositions of infinite graphs. II: The existence of prime decompositions ⋮ Minimization Problems for Infinite n-Connected Graphs ⋮ On end-faithful spanning trees in infinite graphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Some recent progress and applications in graph minor theory ⋮ Structural conditions for cycle completable graphs ⋮ On the complexity of some edge-partition problems for graphs ⋮ Graph classes with given 3-connected components: asymptotic counting and critical phenomena ⋮ Algorithms for convex hull finding in undirected graphical models ⋮ The enumeration of vertex induced subgraphs with respect to the number of components ⋮ Decomposition by maxclique separators ⋮ A compactness theorem for complete separators ⋮ The structure of rayless graphs ⋮ The structure of rating scales ⋮ Theta rank, levelness, and matroid minors ⋮ Decomposing infinite graphs ⋮ Bounded graphs ⋮ Universal elements and the complexity of certain classes of infinite graphs ⋮ Peakless functions on graphs ⋮ Ordinals and graph decompositions ⋮ A characterization of some graph classes using excluded minors ⋮ The structure of \(TK_ a\)-free graphs ⋮ Some finiteness results concerning separation in graphs ⋮ A new proof of the flat wall theorem ⋮ Recognising \(k\)-connected hypergraphs in cubic time ⋮ The end structure of a graph: Recent results and open problems ⋮ On spanning trees and \(k\)-connectedness in infinite graphs ⋮ On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic ⋮ The modular decomposition of countable graphs. Definition and construction in monadic second-order logic ⋮ A proof of the bounded graph conjecture ⋮ Normality of cut polytopes of graphs is a minor closed property ⋮ Excluding Subdivisions of Infinite Cliques ⋮ Decomposability of abstract and path-induced convexities in hypergraphs ⋮ Junction trees of general graphs ⋮ Finding the minimal set for collapsible graphical models ⋮ Simplicial tree-decompositions of infinite graphs. III: The uniqueness of prime decompositions ⋮ A note on \(k\)-connected rayless graphs ⋮ Linear connectivity forces large complete bipartite minors ⋮ Graph classes with given 3-connected components: Asymptotic enumeration and random graphs ⋮ Canonical and monophonic convexities in hypergraphs ⋮ The monadic second-order logic of graphs. VIII: Orientations ⋮ \(K_{a,k}\) minors in graphs of bounded tree-width ⋮ Excluding a countable clique ⋮ A note on partial 3-trees and homomorphism bases of graphs ⋮ An implementation of the iterative proportional fitting procedure by propagation trees.
