The following pages link to (Q5615283):
Displaying 39 items.
- Independence in hypergraphs (Q762178) (← links)
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (Q1006382) (← links)
- A method of determining extremal subgraphs (Q1066912) (← links)
- The theorem on planar graphs (Q1071005) (← links)
- Linear-time recognition of isomorphisms of tree-pictures (Q1077944) (← links)
- A lower bound for the computational complexity of a set of disjunctives in a monotone basis (Q1147681) (← links)
- Problem of path connections in graphs (Q1147682) (← links)
- Star-transitive graphs (Q1163570) (← links)
- On elementary theories of graphs and Abelian loops (Q1219279) (← links)
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density (Q1229732) (← links)
- A proof-scheme in discrete mathematics (Q1256323) (← links)
- On mixed connectivity certificates (Q1274334) (← links)
- On finding a cycle basis with a shortest maximal cycle (Q1349748) (← links)
- Remarks on the theory of graph characteristics (Q1393420) (← links)
- The incidentor coloring of multigraphs and its applications (Q1613375) (← links)
- A characterization of chromatically rigid polynomials (Q1814384) (← links)
- Multifunctional logic modules consisting of elements with bilateral conductance (Q1946366) (← links)
- Representation of a tree with p hanging vertices by 2p-3 elements of its distance matrix (Q2266027) (← links)
- A proof of the unitarity of \(S\)-matrix in a nonlocal quantum field theory (Q2465604) (← links)
- Optimal imbeddings of metrics in graphs (Q2556343) (← links)
- The application of the methods of the theory of logical derivation to graph theory (Q2558225) (← links)
- Generalization of a kernel of a graph (Q2560429) (← links)
- A coloring problem (Q2561233) (← links)
- Minimum spanning tree cycle intersection problem (Q2656964) (← links)
- Some special cases of the transitivity problem in the theory of graphs (Q3037484) (← links)
- Star-shape, Radon number, and minty graphs (Q3487378) (← links)
- Covering the edges of a graph by circuits (Q3496358) (← links)
- The construction of optimal Hamiltonian cycles in multivertex graphs (Q3875959) (← links)
- Translation of sequential program schemes into data-flow schemes (Q3911359) (← links)
- Bijoin points, bibridges, and biblocks of directed graphs (Q3912819) (← links)
- Classification and statistical features of arithmetic graphs (Q3919625) (← links)
- Optimal subgraphs in a weighted digraph (Q3950327) (← links)
- (Q4053695) (← links)
- DISCRETE MODEL OF STATIC LOADS DISTRIBUTION MANAGEMENT ON LATTICE STRUCTURES (Q4973396) (← links)
- DEVELOPMENT OF SPECIAL MATHEMATICAL SOFTWARE USING COMBINATORIAL NUMBERS AND LATTICE STRUCTURE ANALYSIS (Q4973401) (← links)
- PLANARITY TESTING AND CONSTRUCTING THE TOPOLOGICAL DRAWING OF A PLANE GRAPH (DFS) (Q5150740) (← links)
- Analysis of a production control system by graph-theoretic methods (Q5187066) (← links)
- Graph theory (Q5917392) (← links)
- Edge and total coloring of interval graphs (Q5954080) (← links)
