The following pages link to (Q5661516):
Displayed 50 items.
- A graph coloring algorithm for large scale scheduling problems (Q1096533) (← links)
- Classical solvability of linear parabolic equations on networks (Q1121448) (← links)
- Infinite subgraphs as matroid circuits (Q1139051) (← links)
- CPO's of measures for nondeterminism (Q1139367) (← links)
- The structure of exactly strongly consistent social choice functions (Q1152837) (← links)
- The spectrum of an infinite graph (Q1172649) (← links)
- Constructing self-dual codes using graphs (Q1179477) (← links)
- On defect-d matchings in graphs (Q1216323) (← links)
- The limb analysis of countably infinite electrical networks (Q1220883) (← links)
- Connectivity in random networks (Q1230739) (← links)
- A self-dual language for graph theory (Q1231487) (← links)
- On small graphs critical with respect to edge colourings (Q1232418) (← links)
- Some characterization theorems for circuit spaces associated with graphs (Q1237078) (← links)
- On the chromatic number of regular matroids (Q1249582) (← links)
- Theorems on matroid connectivity (Q1251230) (← links)
- Median graphs and Helly hypergraphs (Q1252871) (← links)
- Multiplicity of solutions to second-order linear differential equations on networks (Q1386507) (← links)
- ZAPROS-LM -- a method and system for ordering multiattribute alternatives (Q1388915) (← links)
- Bounds for the augmented Zagreb and the atom-bond connectivity indices (Q1736126) (← links)
- A characteristic equation associated to an eigenvalue problem on \(c^ 2\)-networks (Q1821927) (← links)
- A class of infinitely divisible multivariate negative binomial distributions (Q1822426) (← links)
- Nonreal eigenvalues for second order differential operators on networks with circuits (Q1856910) (← links)
- Symmetrically connected and antisymmetrically connected \(T_0\)-quasi-metric extensions (Q1987231) (← links)
- Certain observations on antisymmetric \(T_0\)-quasi-metric spaces (Q2077298) (← links)
- Refined finiteness and degree properties in graphs (Q2113832) (← links)
- About graph unions and intersections (Q2113833) (← links)
- Unification of graphs and relations in Mizar (Q2113834) (← links)
- Polynomial-time proofs that groups are hyperbolic (Q2229726) (← links)
- On reciprocal reverse Wiener index (Q2267839) (← links)
- On reverse degree distance (Q2267843) (← links)
- Correction to: ``Bounds for the augmented Zagreb and the atom-bond connectivity indices'' (Q2286074) (← links)
- Exponential small-gain theorem and fault tolerant safe control of interconnected nonlinear systems (Q2307552) (← links)
- An axiomatic analysis of the papal conclave (Q2308795) (← links)
- About supergraphs. I (Q2311519) (← links)
- About supergraphs. II (Q2311520) (← links)
- About supergraphs. III (Q2337335) (← links)
- Stability implies constancy for fully autonomous reaction-diffusion-equations on finite metric graphs (Q2416910) (← links)
- The spectrum of the Hilbert space valued second derivative with general self-adjoint boundary conditions (Q2435449) (← links)
- On the complexity of Archimedean solids (Q2503719) (← links)
- Design of test inputs and their sequences in multi-function system testing (Q2505033) (← links)
- On the edge-chromatic number of a graph (Q2558226) (← links)
- Duality in mathematics and linear and integer programming (Q2565013) (← links)
- Constructions of binary codes based on bipartite graphs (Q2630779) (← links)
- Miscellaneous graph preliminaries (Q2658808) (← links)
- Maximum degree and minimum degree spectral radii of some graph operations (Q2688752) (← links)
- PATH-WIDTH OF A GRAPH VS BRIDGE NUMBER OF A KNOT (Q3004777) (← links)
- Determining when a graphic matroid is transversal in linear time (Q3218144) (← links)
- Power diagrams and interaction processes for unions of discs (Q3516392) (← links)
- THE LOGIC OF PARTITIONS: INTRODUCTION TO THE DUAL OF THE LOGIC OF SUBSETS (Q3577748) (← links)
- One-factorizations of the complete graph—A survey (Q3714114) (← links)