The following pages link to (Q5315023):
Displayed 50 items.
- Maximum vertex and face degree of oblique graphs (Q1044926) (← links)
- Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs (Q1045015) (← links)
- A proof of the rooted tree alternative conjecture (Q1045086) (← links)
- Submodular partition functions (Q1045090) (← links)
- A short proof of Fleischner's theorem (Q1045203) (← links)
- Constructing goal-minimally \(k\)-diametric graphs by lifts (Q1759397) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- Token graphs (Q1926040) (← links)
- Trees with given stability number and minimum number of stable sets (Q1926055) (← links)
- Cops and Robber game with a fast robber on expander graphs and random graphs (Q1929738) (← links)
- Exact algorithms for finding longest cycles in claw-free graphs (Q1939671) (← links)
- Towards optimal kernel for connected vertex cover in planar graphs (Q1949125) (← links)
- Dilation coefficient, plane-width, and resolution coefficient of graphs (Q1950340) (← links)
- Heat kernel bounds for the Laplacian on metric graphs of polygonal tilings (Q1955755) (← links)
- Deterministically isolating a perfect matching in bipartite planar graphs (Q1959397) (← links)
- Constraint satisfaction with succinctly specified relations (Q1959431) (← links)
- Packing triangles in \(K_4\)-free graphs (Q2014715) (← links)
- Toroidality of intersection graphs of ideals of commutative rings (Q2014724) (← links)
- Multigraded commutative algebra of graph decompositions (Q2248919) (← links)
- Transitivity conditions in infinite graphs (Q2250834) (← links)
- Pursuing a fast robber on a graph (Q2268876) (← links)
- NP-hardness results for the aggregation of linear orders into median orders (Q2271866) (← links)
- Graph topologies induced by edge lengths (Q2275383) (← links)
- Equistable graphs, general partition graphs, triangle graphs, and graph products (Q2275915) (← links)
- On graphs of defect at most 2 (Q2275941) (← links)
- Manifold topological multi-resolution analysis method (Q2275962) (← links)
- Packing tripods: narrowing the density gap (Q2370436) (← links)
- On group choosability of total graphs (Q2376095) (← links)
- Detecting induced star-like minors in polynomial time (Q2376792) (← links)
- Moduli spaces of metric graphs of genus 1 with marks on vertices (Q2378308) (← links)
- Matroid representation of clique complexes (Q2381814) (← links)
- Graph-like continua, augmenting arcs, and Menger's theorem (Q2390152) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- Subdivisions in apex graphs (Q2392579) (← links)
- Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684) (← links)
- Partitioning 3-homogeneous Latin bitrades (Q2427434) (← links)
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices (Q2427899) (← links)
- Finding induced paths of given parity in claw-free graphs (Q2428656) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- Counting hexagonal patches and independent sets in circle graphs (Q2429365) (← links)
- On Hamiltonicity of \{claw, net\}-free graphs (Q2433732) (← links)
- Positive semidefinite zero forcing (Q2435453) (← links)
- On the critical ideals of graphs (Q2435580) (← links)
- Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs (Q2436666) (← links)
- A unified approach to distance-two colouring of graphs on surfaces (Q2439826) (← links)
- Pathwidth, trees, and random embeddings (Q2439830) (← links)
- Which \(k\)-trees are cover-incomparability graphs? (Q2440118) (← links)
- Communication constraints in the average consensus problem (Q2440647) (← links)
- On the hardness of losing width (Q2441542) (← links)