The following pages link to (Q5572939):
Displaying 50 items.
- Flow analysis sensitivities for models of energy or material flow (Q1050282) (← links)
- Posets and generalized lattices (Q1051009) (← links)
- On the complexity of graphs and molecules (Q1053645) (← links)
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach (Q1057887) (← links)
- Distance degree regular graphs (Q1059640) (← links)
- Counting labelled chordal graphs (Q1062069) (← links)
- A formalization of consensus index methods (Q1062389) (← links)
- A note on similar edges and edge-unique line graphs (Q1062999) (← links)
- Note on the regular digraphs (Q1063622) (← links)
- Automates finis et ensembles normaux. (Finite automata and normal sets) (Q1065062) (← links)
- Randomly n-cyclic digraphs (Q1065824) (← links)
- On 1-factorizability of Cayley graphs (Q1068102) (← links)
- The generation of random, binary unordered trees (Q1068492) (← links)
- On the regulation number of a multigraph (Q1068843) (← links)
- Spins and fermions on arbitrary lattices (Q1070012) (← links)
- On the T(q)-conditions of small cancellation theory (Q1070343) (← links)
- The theorem on planar graphs (Q1071005) (← links)
- Optimal algorithms for comparing trees with labeled leaves (Q1074275) (← links)
- Generalized Steiner problem in outerplanar networks (Q1074505) (← links)
- n-connectedness in pure 2-complexes (Q1076041) (← links)
- Hamiltonian decompositions of complete regular s-partite graphs (Q1076042) (← links)
- Construction of finite p-groups with prescribed group of noncentral automorphisms (Q1085274) (← links)
- The binding number of line graphs and total graphs (Q1086594) (← links)
- Enumeration of projective-planar embeddings of graphs (Q1087549) (← links)
- Goodness of trees for generalized books (Q1087890) (← links)
- Handles in graphs and sphere bundles over \(S^ 1\) (Q1089000) (← links)
- Two theorems on packings of graphs (Q1090341) (← links)
- A graph-theoretical representation of PL-manifolds -- a survey on crystallizations (Q1091639) (← links)
- Line domination in graphs (Q1092932) (← links)
- Grids and their minors (Q1097897) (← links)
- On approximation behavior of the greedy triangulation for convex polygons (Q1098295) (← links)
- Ein Henkeltheorem für geschlossene semilineare Mannigfaltigkeiten. (A handle theorem for closed semilinear manifolds) (Q1098414) (← links)
- On the Euclidean dimension of a wheel (Q1101119) (← links)
- Multiple residues in dimension three (Q1101744) (← links)
- Covering and packing in graphs. V. Mispacking subcubes in hypercubes (Q1102983) (← links)
- The analysis of a nested dissection algorithm (Q1103322) (← links)
- A characterization of undirected branching greedoids (Q1103626) (← links)
- Designing networks with compact routing tables (Q1104109) (← links)
- On well-quasi-ordering-finite graphs by immersion (Q1104345) (← links)
- On the use of ordered sets in problems of comparison and consensus of classifications (Q1104668) (← links)
- Matching extension and the genus of a graph (Q1107545) (← links)
- A polynomial characterization of some graph partitioning problems (Q1108810) (← links)
- Trivalent orbit polynomial graphs (Q1110532) (← links)
- Bigeodetic graphs (Q1110539) (← links)
- INGRID: A graph invariant manipulator (Q1113914) (← links)
- The total interval number of a graph (Q1119605) (← links)
- On the genus of the complex projective plane (Q1120857) (← links)
- Generalized handles in graphs and connected sums of manifolds (Q1120858) (← links)
- Suboptimal cycle bases of graphs for the flexibility analysis of skeletal structures (Q1122399) (← links)
- An upper bound on the shortness exponent of inscribable polytopes (Q1122592) (← links)
