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