The following pages link to (Q5572939):
Displaying 50 items.
- Ein Beitrag zur Ulam-Vermutung (Q1132113) (← links)
- An algorithm for hierarchical reduction and decomposition of a directed graph (Q1132114) (← links)
- Flows and generalized coloring theorems in graphs (Q1133552) (← links)
- Minimal separating sets of maximum size (Q1133558) (← links)
- Neural languages (Q1136715) (← links)
- The book thickness of a graph (Q1136775) (← links)
- Some perfect coloring properties of graphs (Q1136777) (← links)
- Critically partitionable graphs. I (Q1136783) (← links)
- Infinite subgraphs as matroid circuits (Q1139051) (← links)
- Some counterexamples associated with the three-color problem (Q1139601) (← links)
- Hamiltonian-connected tournaments (Q1140091) (← links)
- Panarboreal graphs (Q1140650) (← links)
- Combinatorially symmetric matrices (Q1141727) (← links)
- Planarity and duality of finite and infinite graphs (Q1142781) (← links)
- Erdős-Hajnal well-orderings and n-degenerate graphs (Q1143403) (← links)
- The asymptotic distribution of short cycles in random regular graphs (Q1143412) (← links)
- The asymptotic connectivity of labelled regular graphs (Q1143413) (← links)
- Neighbourhoods of transitive graphs and GRR's (Q1144042) (← links)
- Which trees are link graphs? (Q1146683) (← links)
- The group and the minimal polynomial of a graph (Q1148337) (← links)
- A characterization of 3-connected graphs containing a given graph (Q1154481) (← links)
- Graphs with certain families of spanning trees (Q1154485) (← links)
- Graph factorization, general triple systems, and cyclic triple systems (Q1155058) (← links)
- Reconstruction theorems for graph enumerating polynomials (Q1156153) (← links)
- On the number of subgraphs of prescribed type of graphs with a given number of edges (Q1158165) (← links)
- The smallest 2-connected cubic bipartite planar nonhamiltonian graph (Q1158439) (← links)
- On the number of complete subgraphs contained in certain graphs (Q1159691) (← links)
- A graph theoretic approach to multivariable control system design (Q1160101) (← links)
- More balanced ternary designs with block size three (Q1161746) (← links)
- A note on the circuit polynomials and characteristic polynomials of wheels and ladders (Q1163037) (← links)
- Bounds on the number of cycles of length three in a planar graph (Q1163566) (← links)
- Equational classes of distributive double p-algebras (Q1163580) (← links)
- An effective structured approach to finding optimal partitions of networks (Q1164549) (← links)
- Some general constructions of geodetic blocks (Q1165873) (← links)
- Universal caterpillars (Q1168327) (← links)
- The diffusive Lotka-Volterra system with three species can have a stable non-constant equilibrium solution (Q1170135) (← links)
- An edge-deletion problem for locally finite graphs (Q1172650) (← links)
- Regular multigraphs and their application to the Monte Carlo evaluation of moments of non-linear functions of Gaussian random variables (Q1172870) (← links)
- Finiteness of a cohomology associated with certain Jackson integrals (Q1177402) (← links)
- An interpolation theorem for partitions which are indivisible with respect to cohereditary properties (Q1179468) (← links)
- Note on inscribability of quadrangular polyhedra with restricted number of edge-types (Q1180135) (← links)
- A large class of maximally tough graphs (Q1182141) (← links)
- On graphs with equal domination and independent domination numbers (Q1182987) (← links)
- On the two-dimensional generic rigidity matroid and its dual (Q1186124) (← links)
- Automorphisms of Cayley graphs (Q1187136) (← links)
- Changing and unchanging the diameter of a hypercube (Q1199429) (← links)
- Significance of the length of the shortest tree (Q1203102) (← links)
- A generalization of Menger's theorem for certain unicyclic graphs (Q1205347) (← links)
- On the number of 1-factorizations of the complete graph (Q1212021) (← links)
- Some classes of uniquely 3-colorable graphs (Q1212948) (← links)
