Connectivity, graph minors, and subgraph multiplicity
From MaRDI portal
Publication:4201396
DOI10.1002/jgt.3190170314zbMath0781.05029OpenAlexW2074992286MaRDI QIDQ4201396
Publication date: 24 August 1993
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190170314
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Generalized Ramsey theory (05C55) Graph algorithms (graph-theoretic aspects) (05C85) Ramsey theory (05D10) Connectivity (05C40)
Related Items
Subgraph densities in a surface, Arboricity and bipartite subgraph listing algorithms, Tree densities in sparse graph classes, The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics, Generalized planar Turán numbers, The maximum number of paths of length three in a planar graph, Planar graphs with the maximum number of induced 6-cycles, Graph theory. Abstracts from the workshop held January 2--8, 2022, On the maximum number of cliques in a graph, Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees, Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
