scientific article; zbMATH DE number 3338382
From MaRDI portal
zbMath0213.25801MaRDI QIDQ5615283
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05Cxx)
Related Items
The incidentor coloring of multigraphs and its applications, Linear-time recognition of isomorphisms of tree-pictures, On finding a cycle basis with a shortest maximal cycle, Minimum spanning tree cycle intersection problem, Star-shape, Radon number, and minty graphs, Covering the edges of a graph by circuits, Remarks on the theory of graph characteristics, A lower bound for the computational complexity of a set of disjunctives in a monotone basis, Problem of path connections in graphs, Multifunctional logic modules consisting of elements with bilateral conductance, Star-transitive graphs, PLANARITY TESTING AND CONSTRUCTING THE TOPOLOGICAL DRAWING OF A PLANE GRAPH (DFS), A proof of the unitarity of \(S\)-matrix in a nonlocal quantum field theory, On mixed connectivity certificates, Some special cases of the transitivity problem in the theory of graphs, Representation of a tree with p hanging vertices by 2p-3 elements of its distance matrix, On elementary theories of graphs and Abelian loops, Analysis of a production control system by graph-theoretic methods, On an upper bound of the graph's chromatic number, depending on the graph's degree and density, Edge and total coloring of interval graphs, Graph theory, The construction of optimal Hamiltonian cycles in multivertex graphs, An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs, A proof-scheme in discrete mathematics, DISCRETE MODEL OF STATIC LOADS DISTRIBUTION MANAGEMENT ON LATTICE STRUCTURES, DEVELOPMENT OF SPECIAL MATHEMATICAL SOFTWARE USING COMBINATORIAL NUMBERS AND LATTICE STRUCTURE ANALYSIS, A characterization of chromatically rigid polynomials, On mixed connectivity certificates, Independence in hypergraphs, Translation of sequential program schemes into data-flow schemes, Bijoin points, bibridges, and biblocks of directed graphs, Optimal imbeddings of metrics in graphs, Classification and statistical features of arithmetic graphs, The application of the methods of the theory of logical derivation to graph theory, Generalization of a kernel of a graph, A coloring problem, Unnamed Item, Optimal subgraphs in a weighted digraph, A method of determining extremal subgraphs, The theorem on planar graphs
