Topological cliques in graphs II
From MaRDI portal
Publication:4883063
Recommendations
Cites work
Cited in
(82)- Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density
- Approximating the maximum clique minor and some subgraph homeomorphism problems
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Topological minors in graphs of large girth
- Subdivisions of transitive tournaments
- Immersion of transitive tournaments in digraphs with large minimum outdegree
- Induced subdivisions and bounded expansion
- On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space
- (2k+1)-connected tournaments with large minimum out-degree are k-linked
- Dichromatic number and forced subdivisions
- On 1-subdivisions of transitive tournaments
- Clique immersion in graphs without a fixed bipartite graph
- Subdivisions of digraphs in tournaments
- Subdivisions in digraphs of large out-degree or large dichromatic number
- Subdivisions of a large clique in \(C_6\)-free graphs
- On nowhere dense graphs
- Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
- Highly linked graphs
- Extremal connectivity for topological cliques in bipartite graphs
- Clustered variants of Hajós' conjecture
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- Dynamic coloring of graphs having no \(K_5\) minor
- A structure theorem for strong immersions
- Compact topological minors in graphs
- Coloring immersion-free graphs
- Minors in lifts of graphs
- Number of cliques in graphs with a forbidden subdivision
- Polynomial kernels and faster algorithms for the dominating set problem on graphs with an excluded minor
- A minimum degree condition forcing complete graph immersion
- An extremal problem for subdivisions ofK?5
- scientific article; zbMATH DE number 1047738 (Why is no real title available?)
- Finding and using expanders in locally sparse graphs
- Nested cycles with no geometric crossings
- Topology of clique complexes of line graphs
- Crux and Long Cycles in Graphs
- Hitting minors on bounded treewidth graphs. I: General upper bounds
- Logarithmically small minors and topological minors
- Improper colouring of graphs with no odd clique minor
- Parameterized complexity of directed Steiner tree on sparse graphs
- Graph sharing game and the structure of weighted graphs with a forbidden subdivision
- On colorability of graphs with forbidden minors along paths and circuits
- Local conditions for exponentially many subdivisions
- Improved Bounds for Topological Cliques in Graphs of Large Girth
- List-coloring graphs without subdivisions and without immersions
- On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
- Disjoint isomorphic balanced clique subdivisions
- Rainbow clique subdivisions
- Some mader-perfect graph classes
- Balanced Subdivisions of a Large Clique in Graphs with High Average Degree
- Hat Guessing Numbers of Strongly Degenerate Graphs
- A solution to Erdős and Hajnal’s odd cycle problem
- 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
- Rainbow subdivisions of cliques
- Towards the Erdős-Gallai cycle decomposition conjecture
- Immersion of complete digraphs in Eulerian digraphs
- Separating path systems of almost linear size
- Nested cycles with no geometric crossings
- Extremal density for sparse minors and subdivisions
- Many Hamiltonian subsets in large graphs with given density
- Spanning subdivisions in Dirac graphs
- Crux, space constraints and subdivisions
- Nearly Hamilton cycles in sublinear expanders and applications
- Extremal density for subdivisions with length or sparsity constraints
- Induced subdivisions in \(K_{s,s}\)-free graphs with polynomial average degree
- Oriented cycles in digraphs of large outdegree
- Induced C₄-free subgraphs with large average degree
- Essentially tight bounds for rainbow cycles in proper edge-colourings
- Crux, space constraints and subdivisions (extended abstract)
- Edge-disjoint cycles with the same vertex set
- Embedding clique subdivisions via crux
- Isomorphism testing for graphs excluding small topological subgraphs
- Immersions of directed graphs in tournaments
- Rank-width and tree-width of \(H\)-minor-free graphs
- Balanced chromatic number and Hadwiger-like conjectures
- Title not available (Why is no real title available?)
- New exact values of the maximum size of graphs free of topological complete subgraphs
- Some recent progress and applications in graph minor theory
- Sublinear separators, fragility and subexponential expansion
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)
