The following pages link to (Q5315023):
Displayed 50 items.
- Contractible and removable edges in 3-connected infinite graphs (Q2354601) (← links)
- Uniquely derived generalized line graphs and uniquely represented signed graphs with least eigenvalues \(\geq -2\) (Q2354616) (← links)
- Inductive constructions for frameworks on a two-dimensional fixed torus (Q2354675) (← links)
- Network bipartivity and the transportation efficiency of European passenger airlines (Q2357544) (← links)
- On covers of graphs by Cayley graphs (Q2359978) (← links)
- The planar cubic Cayley graphs of connectivity 2 (Q2359984) (← links)
- Using relation-algebraic means and tool support for investigating and computing bipartitions (Q2360655) (← links)
- An external-memory algorithm for string graph construction (Q2362353) (← links)
- Gamma graphs of some special classes of trees (Q2363620) (← links)
- Packing tripods: narrowing the density gap (Q2370436) (← links)
- The Turán number of disjoint copies of paths (Q2374168) (← 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)
- Vizing's conjecture: A two-thirds bound for claw-free graphs (Q2399303) (← links)
- Packing and covering immersion-expansions of planar sub-cubic graphs (Q2400977) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- A polynomial-time algorithm for outerplanar diameter improvement (Q2402366) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Signed-graphic matroids with all-graphic cocircuits (Q2404380) (← links)
- Dynamics of global remittances: a graph-based analysis (Q2406939) (← links)
- Breaking graph symmetries by edge colourings (Q2407385) (← links)
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (Q2408559) (← links)
- Tractability, hardness, and kernelization lower bound for and/or graph solution (Q2410230) (← links)
- Advances in Aharoni-Hartman-Hoffman's conjecture for split digraphs (Q2413158) (← links)
- Graph bases and diagram commutativity (Q2413619) (← links)
- Certifying coloring algorithms for graphs without long induced paths (Q2414471) (← links)
- Modeling the functional network of primary intercellular Ca\(^{2+}\) wave propagation in astrocytes and its application to study drug effects (Q2415580) (← links)
- Human dopamine receptors interaction network (DRIN): a systems biology perspective on topology, stability and functionality of the network (Q2415626) (← links)
- On the restricted size Ramsey number involving a path \(P_3\) (Q2416960) (← links)
- Fast exact algorithms for some connectivity problems parameterized by clique-width (Q2420640) (← 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)