The following pages link to (Q5315023):
Displayed 50 items.
- A graph-theoretic approach to a partial order of knots and links (Q960836) (← links)
- Every minor-closed property of sparse graphs is testable (Q962147) (← links)
- A self-stabilizing algorithm for cut problems in synchronous networks (Q962165) (← links)
- Discovery of network properties with all-shortest-paths queries (Q962167) (← links)
- Rank functions on rooted tree quivers. (Q963735) (← links)
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture (Q965260) (← links)
- Normality of cut polytopes of graphs is a minor closed property (Q966011) (← links)
- Partitions versus sets: a case of duality (Q966122) (← links)
- Ramsey numbers of long cycles versus books or wheels (Q966139) (← links)
- The edge-flipping group of a graph (Q966148) (← links)
- The Clar formulas of a benzenoid system and the resonance graph (Q967298) (← links)
- Complete catalogue of graphs of maximum degree 3 and defect at most 4 (Q967350) (← links)
- On cover-structure graphs (Q967385) (← links)
- Most balanced minimum cuts (Q968139) (← links)
- On Barnette's conjecture (Q968428) (← links)
- Abstract Arrowian aggregation (Q969114) (← links)
- A new characterization of \(P_{6}\)-free graphs (Q972332) (← links)
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
- On induced-universal graphs for the class of bounded-degree graphs (Q975466) (← links)
- Embedding a family of disjoint multi-dimensional meshes into a crossed cube (Q975501) (← links)
- On graphs isomorphic to their neighbour and non-neighbour sets (Q976164) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Homomorphism preservation on quasi-wide classes (Q980940) (← links)
- Independence complexes of chordal graphs (Q982628) (← links)
- A note on graph minors and strong products (Q990784) (← links)
- Infinite highly connected planar graphs of large girth (Q998244) (← links)
- An algorithmic approach to finding factorial designs with generalized minimum aberration (Q998979) (← links)
- Bicycles and left-right tours in locally finite graphs (Q1003585) (← links)
- Transforming a graph into a 1-balanced graph (Q1003673) (← links)
- Graph structural properties of non-Yutsis graphs allowing fast recognition (Q1003683) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- MacLane's theorem for arbitrary surfaces (Q1003829) (← links)
- HyPAM: A hybrid continuum-particle model for incompressible free-surface flows (Q1005511) (← links)
- Generalized thrackle drawings of non-bipartite graphs (Q1006402) (← links)
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem (Q1007120) (← links)
- Operated semigroups, Motzkin paths and rooted trees (Q1016141) (← links)
- Distributed randomized algorithms for probabilistic performance analysis (Q1016599) (← links)
- Harmonic analysis for graph refinements and the continuous graph FFT (Q1019728) (← links)
- Clique numbers of graphs and irreducible exact \(m\)-covers of the integers (Q1023392) (← links)
- Linear bound on extremal functions of some forbidden patterns in 0-1 matrices (Q1024495) (← links)
- Capacitive flows on a 2D random net (Q1024897) (← links)
- Graph operations characterizing rank-width (Q1028455) (← links)
- Fibonacci numbers and Lucas numbers in graphs (Q1028490) (← links)
- Parallelizing quantum circuits (Q1029356) (← links)
- Spectra of copies of a generalized Bethe tree attached to any graph (Q1030749) (← links)
- Embedding a family of disjoint 3D meshes into a crossed cube (Q1031688) (← links)
- Classifying homeomorphism groups of infinite graphs (Q1032926) (← links)
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances (Q1034528) (← links)
- Partitioning graphs into connected parts (Q1034603) (← links)
- A deflection-based bridge diagnosis method (Q1036315) (← links)