scientific article; zbMATH DE number 3341035
From MaRDI portal
zbMath0214.50804MaRDI QIDQ5617548
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)
Related Items
On fuzzy tree definition, Flots et tensions dans un graphe, Dioïds and semirings: Links to fuzzy sets and other applications, Stochastic controllability of linear systems with Markovian jumps, An Algorithm for Vertex-pair Connectivity, Network design and defence, Some Basic Definitions in Graph Theory, Algorithmizing design of a class of combinatorial block diagrams, Large Cayley graphs on an abelian group, Analysis of preferential experiments, BRS-compactness in networks: Theoretical considerations related to cohesion in citation graphs, collaboration networks and the internet, Efficient domination of the orientations of a graph, The minimal cost maximum matching of a graph, Kronrod-Reeb graphs of functions on noncompact two-dimensional surfaces. II, Inequalities for the chromatic numbers of graphs, Trees as level sets for pseudoharmonic functions in the plane, A Note on Isolate Domination Number of a Cubic Graph, Unnamed Item, Unnamed Item, Unnamed Item, Abstract interpretation of graphs, Unnamed Item, Le problème d'étoiles pour graphes est NP-complèt, Choices and kernels in bipolar valued digraphs, Extremal graphs for a new upper bound on domination parameters in graphs, Unimodular modules, Unnamed Item, Unnamed Item, Unnamed Item, Algebra - 9, Efficiently hex-meshing things with topology, Techniques of semigroup ring theory: Artinian, perfect, and semiprimary semigroup rings, Meta-resolution: An algorithmic formalisation, Unnamed Item, Tseitin's formulas revisited, Extremal perfect graphs for a bound on the domination number, Interval edge-colorings of composition of graphs, Matching theory -- a sampler: From Dénes König to the present, The free partially commutative Lie algebra: Bases and ranks, [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions], Diagonally dominant matrices, On pseudounimodular matrices, Random generation of DFAs, Independence numbers of product graphs, Some balanced complete block designs, Results and problems in the theory of doubly-stochastic matrices, Some remarks on the chromatic index of a graph, A greedy algorithm for maximizing a linear objective function, Covers, matchings and odd cycles of a graph, Unnamed Item, Théorie des ecoulements dans les graphes orientes sans circuit, Central ray method in the problem of preference intensity quantification based on paired comparisons, Unnamed Item, Unnamed Item, Développements recents de la théorie des graphes, Unnamed Item, Unnamed Item, Unnamed Item, Semantics in problem representation and search, Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications, Unnamed Item, Étude syntaxique de certains langages solutions d'équations avec opérateurs, Unnamed Item, Formal methods for verification of websites macrostructure integrity, The group of autotopies of a digraph, Sulla tracciabilita' di grafi finiti su superficie compatte, Omomorfismi fra grafi e grafi moltiplicativi, Unnamed Item, A note upon minimal path problem, On disjunctive domination in graphs, Choice procedure in fuzzy multicriteria decision analysis based on pairwise comparisons, Nucleo di una rete PERT e problema dei ritardi, A graph theory oriented extension to ALGOL, $B$-valuations of graphs, Graphes fortement connexes c-minimaux et graphes sans circuit co-minimaux, On the design of correct and optimal dynamical systems and games, Mehrdimensionale Zuordnungsprobleme und Netzwerkflüsse mit vorgegebenen Wertemengen. (Multi-dimensional assignment problems and network flows with given sets of values.), Unnamed Item, Sur un problème de Erdős et Hajnal, Representation of fragmentary structures by oriented graphs, On the unicity of solutions of problems of best approximations, Principles of enumeration of the number of graphs, On computing the time complexity of transitive closure algorithms, Packing and domination parameters in digraphs, Graphes connexes représentation des entiers et équirepartition, Spectral rank monotonicity on undirected networks, On convex partitions of polygonal regions, On fuzzification of some concepts of graphs, Financial systems: A few theoretical and algebraic considerations for their modeling, Application of pseudo-Boolean programming to the theory of graphs, A geometric interpretation of one-dimensional quasinormal rings, On chromatic number of graphs and set-systems, 1-Triangle graphs and perfect neighborhood sets, The theorem on planar graphs
