The following pages link to (Q5668821):
Displayed 50 items.
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- A category-theoretical approach to hypergraphs (Q599833) (← links)
- Hamiltonian circuits, Hamiltonian paths and branching graphs of benzenoid systems (Q679069) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Deadlock-freedom in resource contentions (Q801672) (← links)
- Computing the maximum-entropy extension of given discrete probability distributions (Q804113) (← links)
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
- An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288) (← links)
- Chain packing in graphs (Q808291) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- A new analysis of quasianalysis (Q877242) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← links)
- Graph models for scheduling systems with machine saturation property (Q883067) (← links)
- Partitioning multi-edge graphs (Q911315) (← links)
- Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs (Q911763) (← links)
- NP-complete problems simplified on tree schemas (Q1056539) (← links)
- On 1-factorizability of Cayley graphs (Q1068102) (← links)
- List-colourings of graphs (Q1084403) (← links)
- Semi-duality and the cycle double cover conjecture (Q1085163) (← links)
- An upper bound for families of linearly related plane convex sets (Q1097521) (← links)
- Nim games with arbitrary periodic moving orders (Q1108944) (← links)
- Opposition graphs are strict quasi-parity graphs (Q1118614) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Large fault-tolerant interconnection networks (Q1120553) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- An NC algorithm for Brooks' theorem (Q1124351) (← links)
- The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true (Q1128134) (← links)
- Micro-analyticity of the S-matrix and related functions (Q1134917) (← links)
- The frequency of cyclic processes in biological multistate systems (Q1139329) (← links)
- A unified theory of symmetry for nonlinear resistive networks (Q1140606) (← links)
- A new linear programming algorithm - better or worse than the simplex method? (Q1153837) (← links)
- Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets (Q1158173) (← links)
- A generalization of the matrix-tree theorem (Q1160631) (← links)
- Extending an extension of Grinberg's theorem (Q1164056) (← links)
- On the combinatorial problems which I would most like to see solved (Q1164626) (← links)
- Gallai's problem on Dirac's construction (Q1197042) (← links)
- A linear algorithm for the domination number of a tree (Q1219556) (← links)
- Graphic sequences with unique realization (Q1219896) (← links)
- On maximally distant spanning trees of a graph (Q1229218) (← links)
- On the existence of k-separated finite and infinite dipaths (Q1235181) (← links)
- The complexity of comparability graph recognition and coloring (Q1241524) (← links)
- Uniqueness of colorings (Q1244242) (← links)
- A note on perfect Gaussian elimination (Q1246439) (← links)
- Dynamic detection of subgraphs in computer networks (Q1263956) (← links)
- The primitivity of the strong product of two directed graphs (Q1309464) (← links)
- The sequence of upper and lower domination, independence and irredundance numbers of a graph (Q1313851) (← links)
- Random graphs as a model for pregeometry (Q1330095) (← links)
- Crystallographic reptiles (Q1336248) (← links)
- Cayley, Marty and Schreier hypergraphs (Q1341254) (← links)
- Model-based inference in CHARME. (Q1342427) (← links)