Connectivity, graph minors, and subgraph multiplicity
From MaRDI portal
Publication:4201396
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Connectivity (05C40) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Recommendations
- On the number of connected subgraphs of graphs
- On the minimum degree and the proper connection number of graphs
- scientific article; zbMATH DE number 3970793
- Graph minors and linkages
- Rank connectivity and pivot-minors of graphs
- The connectivity of minimal imperfect graphs
- Connectivity and minimal distance spectral radius of graphs
- Minimum degree and size conditions for the proper connection number of graphs
- Minimum multiplicities of subgraphs and Hamiltonian cycles
- Connectednesses of graphs and congruences
Cited in
(20)- Generalized planar Turán numbers
- On sparse subgraphs preserving connectivity properties
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
- Linear connectivity forces large complete bipartite minors
- On the number of connected subgraphs of graphs
- Bounding the number of odd paths in planar graphs via convex optimization
- Tree densities in sparse graph classes
- Subgraph densities in a surface
- On the frequency of 3-connected subgraphs of planar graphs
- Minimal extremal graphs for addition of algebraic connectivity and independence number of connected graphs
- Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees
- On the maximum number of cliques in a graph
- Planar graphs with the maximum number of induced 6-cycles
- The maximum number of paths of length three in a planar graph
- Arboricity and bipartite subgraph listing algorithms
- The maximum number of pentagons in a planar graph
- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
- Connecting Terminals and 2-Disjoint Connected Subgraphs
- The Minset-Poset Approach to Representations of Graph Connectivity
This page was built for publication: Connectivity, graph minors, and subgraph multiplicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4201396)
