Pages that link to "Item:Q2531599"
From MaRDI portal
The following pages link to Homomorphieeigenschaften und mittlere Kantendichte von Graphen (Q2531599):
Displaying 50 items.
- Average degree conditions forcing a minor (Q259170) (← links)
- Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003) (← links)
- Small complete minors above the extremal edge density (Q313429) (← links)
- Short proofs of some extremal results. II. (Q326811) (← links)
- On zeros of the characteristic polynomial of matroids of bounded tree-width (Q338570) (← links)
- Small minors in dense graphs (Q427808) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Highly linked tournaments (Q491002) (← links)
- Independent sets in graphs (Q501998) (← links)
- An advance in infinite graph models for the analysis of transportation networks (Q511389) (← links)
- The edge-density for \(K_{2,t}\) minors (Q618032) (← links)
- Polynomial treewidth forces a large grid-like-minor (Q661945) (← links)
- Forcing unbalanced complete bipartite minors (Q703605) (← links)
- Dense graphs have \(K_{3,t}\) minors (Q709308) (← links)
- Locally finite graphs with ends: A topological approach. II: Applications (Q709326) (← links)
- On the discrepancy between two Zagreb indices (Q724879) (← links)
- On the Hadwiger's conjecture for graph products (Q864168) (← links)
- New exact values of the maximum size of graphs free of topological complete subgraphs (Q870962) (← links)
- Network bargaining: using approximate blocking sets to stabilize unstable instances (Q904691) (← links)
- Disjoint unions of complete minors (Q941374) (← links)
- On \(K_{s,t}\)-minors in graphs with given average degree (Q941384) (← links)
- The extremal function for 3-linked graphs (Q947723) (← links)
- Single source shortest paths in \(H\)-minor free graphs (Q986535) (← links)
- The Erdös-Pósa property for matroid circuits (Q1003843) (← links)
- Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density (Q1011746) (← links)
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
- Cliques, minors and apex graphs (Q1043579) (← links)
- Even cycles in directed graphs (Q1084409) (← links)
- Graph decomposition with constraints in the minimum degree (Q1102305) (← links)
- On well-quasi-ordering-finite graphs by immersion (Q1104345) (← links)
- Kempe classes and the Hadwiger conjecture (Q1157337) (← links)
- On the combinatorial problems which I would most like to see solved (Q1164626) (← links)
- S-functions for graphs (Q1230790) (← links)
- Semi-topological subgraphs (Q1257029) (← links)
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← links)
- Cliques in dense GF(\(q\))-representable matroids (Q1405118) (← links)
- The extremal function for unbalanced bipartite minors (Q1408877) (← links)
- Subdivisions of transitive tournaments (Q1590220) (← links)
- On the critical densities of minor-closed classes (Q1621066) (← links)
- Immersion of transitive tournaments in digraphs with large minimum outdegree (Q1633763) (← links)
- On the purity of minor-closed classes of graphs (Q1719590) (← links)
- The extremal functions of classes of matroids of bounded branch-width (Q1748000) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- The extremal function and Colin de Verdière graph parameter (Q1753124) (← links)
- On \(K_{s,t}\)-minors in graphs with given average degree. II (Q1759392) (← links)
- On the structure of \(k\)-connected graphs without \(K_{k}\)-minor (Q1767621) (← links)
- An improved linear edge bound for graph linkages (Q1767622) (← links)
- The extremal function for complete minors (Q1850528) (← links)
- High-girth graphs avoiding a minor are nearly bipartite (Q1850553) (← links)
- Existence of vertices of local connectivity \(k\) in digraphs of large outdegree (Q1906850) (← links)
