Subdivisions of large complete bipartite graphs and long induced paths in k‐connected graphs
From MaRDI portal
Publication:4459605
Recommendations
- Combinatorial Geometry and Graph Theory
- Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
- A result on large induced subgraphs with prescribed residues in bipartite graphs
- Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes
- Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs
- On large sets of \(K_{1, p}\)-decomposition of complete bipartite graphs
- Subdivisions of graphs with large minimum degree
- Subdivisions of graphs: A generalization of paths and cycles
- On Subgraphs of the Complete Bipartite Graph
- Large induced subgraphs with \(k\) vertices of almost maximum degree
Cites work
Cited in
(6)- Lower and upper bounds for long induced paths in 3-connected planar graphs
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
- Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes
- Unavoidable Induced Subgraphs of Large 2-Connected Graphs
- Topological minors in bipartite graphs
- Induced subdivisions with pinned branch vertices
This page was built for publication: Subdivisions of large complete bipartite graphs and long induced paths in k‐connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4459605)