Publication:5668821
From MaRDI portal
zbMath0254.05101MaRDI QIDQ5668821
Publication date: 1973
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05Cxx: Graph theory
Related Items
Minimum-weight two-connected spanning networks, A category-theoretical approach to hypergraphs, Hamiltonian circuits, Hamiltonian paths and branching graphs of benzenoid systems, Recent trends in combinatorial optimization, Deadlock-freedom in resource contentions, Computing the maximum-entropy extension of given discrete probability distributions, Finding maximum cliques in arbitrary and in special graphs, An efficient parallel algorithm for computing a large independent set in a planar graph, Chain packing in graphs, Bibliography on domination in graphs and some basic definitions of domination parameters, A new analysis of quasianalysis, Time slot scheduling of compatible jobs, Graph models for scheduling systems with machine saturation property, Partitioning multi-edge graphs, Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs, NP-complete problems simplified on tree schemas, On 1-factorizability of Cayley graphs, List-colourings of graphs, Semi-duality and the cycle double cover conjecture, An upper bound for families of linearly related plane convex sets, Nim games with arbitrary periodic moving orders, Opposition graphs are strict quasi-parity graphs, Algorithmic aspects of intersection graphs and representation hypergraphs, Large fault-tolerant interconnection networks, The Boolean quadratic polytope: Some characteristics, facets and relatives, An NC algorithm for Brooks' theorem, The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true, Micro-analyticity of the S-matrix and related functions, The frequency of cyclic processes in biological multistate systems, A unified theory of symmetry for nonlinear resistive networks, A new linear programming algorithm - better or worse than the simplex method?, Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets, A generalization of the matrix-tree theorem, Extending an extension of Grinberg's theorem, On the combinatorial problems which I would most like to see solved, Gallai's problem on Dirac's construction, A linear algorithm for the domination number of a tree, Graphic sequences with unique realization, On maximally distant spanning trees of a graph, On the existence of k-separated finite and infinite dipaths, The complexity of comparability graph recognition and coloring, Uniqueness of colorings, A note on perfect Gaussian elimination, Dynamic detection of subgraphs in computer networks, The primitivity of the strong product of two directed graphs, The sequence of upper and lower domination, independence and irredundance numbers of a graph, Random graphs as a model for pregeometry, Crystallographic reptiles, Cayley, Marty and Schreier hypergraphs, Model-based inference in CHARME., A hypergraph model for constraint logic programming and applications to bus drivers' scheduling, Probability propagation, The strongly perfectness of normal product of \(t\)-perfect graphs, Recognizing intersection graphs of linear uniform hypergraphs, Paths with minimum range and ratio of arc lengths, On \(k\)-hypertournament matrices, Note on the outdegree of a node in random recursive trees, The graph sandwich problem for 1-join composition is NP-complete, Even cycles in hypergraphs, Remarks on hyperenergetic circulant graphs, Interval stability and interval covering property in finite posets, Some extensions of a hypergraph, Matchings and covers in hypergraphs, Sorting, linear time and the satisfiability problem, Isolating the most recent entry in a random recursive tree by random cuts, Potts models and random-cluster processes with many-body interactions, Close-to-optimal and near-optimal broadcasting in random graphs, Any complete preference structure without circuit admits an interval representation, Compatible connectedness in graphs and topological spaces, Dynamic maintenance of the transitive closure in disjunctive graphs, On the strong chromatic index of cyclic multigraphs, Multicolor routing in the undirected hypercube, The Gauss-Manin connection of the integral of the deformed difference product, Matroidal bijections between graphs, On the vertex packing problem, Score lists in tripartite hypertournaments, The analysis of free-sorting data: Beyond pairwise cooccurrences, Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments, On the upper critical dimension of lattice trees and lattice animals, Unnamed Item, Unnamed Item, Covering, Packing and Generalized Perfection, Unnamed Item, Preemptive Scheduling, Linear Programming and Network Flows, Fractional covers for forests and matchings, A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds, The reduced sets: A new solution concept for cooperative games and other decision problems, On-line models and algorithms for max independent set, On the problem of domino recognition, Nonexistence of Invariant Measures, On Invariants of Graphs with Applications to Knot Theory, A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs, An Improved Algorithm for Finding Cycles Through Elements, Unnamed Item, Maximum Rank of Powers of a Matrix of a Given Pattern, Some Graph-Colouring Theorems with Applications to Generalized Connection Networks, Ranking the Vertices of a Paired Comparison Digraph, The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs, A note on strong perfectness of graphs, On box totally dual integral polyhedra, On bandwidth, cutwidth, and quotient graphs, The Hamilton circuit problem on grids, Separation Properties for Self-Similar Sets, Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances, Unnamed Item, Integral decomposition in polyhedra, On the Exponent of a Primitive, Nearly Reducible Matrix. II, The flow circulation sharing problem, Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Broadcasting in random graphs, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Characterizations of optimal scalings of matrices, On some characterisations of totally unimodular matrices, Optimum matching forests I: Special weights, Optimum matching forests II: General weights, A Combinatorial Proof of the All Minors Matrix Tree Theorem, Covering Regions with Squares, Normalization of place/transition-systems preserves net behaviour, Unnamed Item, Some results in chromatic scheduling, Line perfect graphs, Maximizing the minimum source-sink path subject to a budget constraint, Compactness and balancing in scheduling, Unnamed Item, The Independence Ratio and Genus of a Graph
