Topics in structural graph theory
From MaRDI portal
Recommendations
Cited in
(17)- On the critical densities of minor-closed classes
- Constructing edge-disjoint Steiner paths in lexicographic product networks
- On the \(k\)-component independence number of a tree
- Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs
- A combinatorial characterization of finite groups of prime exponent
- Toughness, binding number and restricted matching extension in a graph
- Path-connectivity of lexicographic product graphs
- Topics in graph automorphisms and reconstruction
- Graphs with large generalized (edge-)connectivity
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP
- Generalized connectivity of some total graphs
- On the embedding of groups and designs in a difference block design
- Graphs defined on groups
- Contractible edges in longest cycles
- Note for the conjecture on the generalized 4-connectivity of total graphs of the complete bipartite graph
- Efficient augmented block designs for unreplicated test treatments along with replicated controls
- On extremal graphs with at most internally disjoint Steiner trees connecting any n-1 vertices
This page was built for publication: Topics in structural graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2911581)