Name
Title | ||
|---|---|---|
Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs |
Abstract | ||
|---|---|---|
It is proved that for every positive integers k, r and s there exists an integer n = n(k,r,s) such that every k-connected graph of order at least n contains either an induced path of length s or a subdivision of the complete bipartite graph Kk,r. © 2004 Wiley Periodicals, Inc. J Graph Theory 45: 270–274, 2004 |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1002/jgt.v45:4 | Journal of Graph Theory |
Keywords | Field | DocType |
connected graph,complete bipartite graph,induced path | Discrete mathematics,Topology,Complete bipartite graph,Combinatorics,Line graph,Edge-transitive graph,Forbidden graph characterization,Distance-hereditary graph,Cograph,Mathematics,Pancyclic graph,Voltage graph | Journal |
Volume | Issue | Citations |
45 | 4 | 3 |
PageRank | References | Authors |
0.41 | 4 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Böhme | 1 | 172 | 21.73 |
| Bojan Mohar | 2 | 1523 | 192.05 |
| Riste Škrekovski | 3 | 607 | 83.39 |
| Michael Stiebitz | 4 | 207 | 30.08 |