The following pages link to (Q5661516):
Displayed 50 items.
- A local hierarchy theory for acyclic digraphs (Q596845) (← links)
- BRS-compactness in networks: Theoretical considerations related to cohesion in citation graphs, collaboration networks and the internet (Q597404) (← links)
- Linear algorithms for edge-coloring trees and unicyclic graphs (Q600259) (← links)
- On a packing problem for infinite graphs and independence spaces (Q754225) (← links)
- Independence in hypergraphs (Q762178) (← links)
- Hamiltonian decompositions of complete graphs (Q795057) (← links)
- Recharacterizing Eulerian: Intimations of new duality (Q798673) (← links)
- Graphs, random sums, and sojourn time distributions, with application to ion-channel modeling (Q811439) (← links)
- On chaotic graphs and applications in physics and biology (Q813526) (← links)
- Perturbation of spectral subspaces and solution of linear operator equations (Q1053956) (← links)
- The theorem on planar graphs (Q1071005) (← links)
- Hamiltonian decompositions of complete regular s-partite graphs (Q1076042) (← links)
- Coloring planar perfect graphs by decomposition (Q1093649) (← links)
- 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)
- 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)
- 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)
- Determining when a graphic matroid is transversal in linear time (Q3218144) (← links)
- Power diagrams and interaction processes for unions of discs (Q3516392) (← links)
- One-factorizations of the complete graph—A survey (Q3714114) (← links)
- On the ranks of certain finite semigroups of transformations (Q3759049) (← links)
- Sturm-Liouville eigenvalue problems on networks (Q3797512) (← links)
- (Q3939829) (← links)
- On colouring random graphs (Q4050627) (← links)
- On the duality of interaction models (Q4106226) (← links)
- Stochastic scheduling with order constraints (Q4108132) (← links)
- A bibliographic survey of edge‐colorings (Q4192088) (← links)
- A new proof of menger's theorem (Q4193505) (← links)
- An Optimal Diagonal Tree Code (Q4750658) (← links)