Topological cliques in graphs II
From MaRDI portal
Publication:4883063
DOI10.1017/S096354830000184XzbMATH Open0846.05023OpenAlexW2109542562MaRDI QIDQ4883063FDOQ4883063
Publication date: 1 July 1996
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s096354830000184x
Recommendations
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)
Cites Work
Cited In (69)
- Immersion of complete digraphs in Eulerian digraphs
- Nested cycles with no geometric crossings
- Extremal density for sparse minors and subdivisions
- Rainbow clique subdivisions
- Balanced Subdivisions of a Large Clique in Graphs with High Average Degree
- Separating path systems of almost linear size
- Disjoint isomorphic balanced clique subdivisions
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- How to build a pillar: a proof of Thomassen's conjecture
- Subdivisions with congruence constraints in digraphs of large chromatic number
- Towards the Erdős-Gallai cycle decomposition conjecture
- Tight bounds for divisible subdivisions
- Many Hamiltonian subsets in large graphs with given density
- Spanning subdivisions in Dirac graphs
- Rainbow subdivisions of cliques
- Crux, space constraints and subdivisions
- Towards the Erdős-Gallai cycle decomposition conjecture
- Subdivisions of digraphs in tournaments
- On colorability of graphs with forbidden minors along paths and circuits
- Number of Cliques in Graphs with a Forbidden Subdivision
- On nowhere dense graphs
- Extremal connectivity for topological cliques in bipartite graphs
- Nested cycles with no geometric crossings
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- Dynamic coloring of graphs having no \(K_5\) minor
- On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Improved Bounds for Topological Cliques in Graphs of Large Girth
- Some mader-perfect graph classes
- Polynomial kernels and faster algorithms for the dominating set problem on graphs with an excluded minor
- Immersion of transitive tournaments in digraphs with large minimum outdegree
- A structure theorem for strong immersions
- Approximating the maximum clique minor and some subgraph homeomorphism problems
- Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density
- Rank-width and tree-width of \(H\)-minor-free graphs
- Local Conditions for Exponentially Many Subdivisions
- Logarithmically small minors and topological minors
- Some recent progress and applications in graph minor theory
- Coloring immersion-free graphs
- A minimum degree condition forcing complete graph immersion
- On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
- Title not available (Why is that?)
- Subdivisions in digraphs of large out-degree or large dichromatic number
- Sublinear separators, fragility and subexponential expansion
- Crux and Long Cycles in Graphs
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds
- Topology of clique complexes of line graphs
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
- Clique immersion in graphs without a fixed bipartite graph
- Improper colouring of graphs with no odd clique minor
- Proof of Komlós's conjecture on Hamiltonian subsets
- \((2k+1)\)-connected tournaments with large minimum out-degree are \(k\)-linked
- Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
- Subdivisions of transitive tournaments
- Induced subdivisions and bounded expansion
- Hat Guessing Numbers of Strongly Degenerate Graphs
- New exact values of the maximum size of graphs free of topological complete subgraphs
- Dichromatic number and forced subdivisions
- Compact topological minors in graphs
- Minors in lifts of graphs
- Clustered variants of Hajós' conjecture
- On 1-subdivisions of transitive tournaments
- An extremal problem for subdivisions ofK?5
- Topological minors in graphs of large girth
- Subdivisions of a large clique in \(C_6\)-free graphs
- A solution to Erdős and Hajnal’s odd cycle problem
- Finding and Using Expanders in Locally Sparse Graphs
- Highly linked graphs
- Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision
This page was built for publication: Topological cliques in graphs II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883063)
