scientific article; zbMATH DE number 3400923
From MaRDI portal
zbMath0254.05101MaRDI QIDQ5668821
Publication date: 1973
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
Covering Regions with Squares, Defective colorings on k-uniform hypergraphs, Domination topological indices and their polynomials of a firefly graph, Random recursive hypergraphs, Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension, ON SEVERAL PROPERTIES OF A CLASS OF PREFERENTIAL ATTACHMENT TREES—PLANE-ORIENTED RECURSIVE TREES, Pattern Formation on Hypergraphs, The Master Stability Function for Synchronization in Simplicial Complexes, Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs, Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation, Unnamed Item, Unnamed Item, Unnamed Item, Normalization of place/transition-systems preserves net behaviour, Unnamed Item, NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs, On parallel complexity of maximum f-matching and the degree sequence problem, ON LOCALLY-BALANCED 2-PARTITIONS OF BIPARTITE GRAPHS, LOCALLY-BALANCED $k$-PARTITIONS OF GRAPHS, Homology of weighted path complexes and directed hypergraphs, On the distance energy of \(k\)-uniform hypergraphs, Is Logic Relevant to Classifications?, The algorithms for the Eulerian cycle and Eulerian trail problems for a multiple graph, Discrete differential calculus on simplicial complexes and constrained homology, The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph, Porous exponential domination number of some graphs, Smallest maximal matchings of graphs, On the kernel and related problems in interval digraphs, Solving moment hierarchies for chemical reaction networks, Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation, What Are Higher-Order Networks?, Random hypergraphs, random simplicial complexes and their Künneth-type formulae, Non-oblivious local search for graph and hypergraph coloring problems, Packing arc-disjoint cycles in oriented graphs, Synchronization in Temporal Simplicial Complexes, A Spatial Logic for Simplicial Models, Novel group decision making approach based on the rough soft approximations of graphs and hypergraphs, Persistent hyperdigraph homology and persistent hyperdigraph Laplacians, The Tuza–Vestergaard Theorem, Some interpretations for algebraic invariants of edge ideals of hypergraphs via combinatorial invariants, Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian, Grundy number of corona product of some graphs, On \(3\)-uniform hypergraphs avoiding a cycle of length four, Unnamed Item, Some results in chromatic scheduling, Unnamed Item, The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm, Unnamed Item, Exact Solution of the Evasive Flow Capturing Problem, Optimal coteries for rings and related networks, Well-indumatched Trees and Graphs of Bounded Girth, The approximation of maximum subgraph problems, On bandwidth, cutwidth, and quotient graphs, The Hamilton circuit problem on grids, Topological Complexities of Finite Digital Images, Hypergraphs with pendant paths are not chromatically unique, Chain-code pictures and collages generated by hyperedge replacement, Formal structure of periodic system of elements, Unnamed Item, Hypergraphs and intervals, On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs, Unnamed Item, Line perfect graphs, Maximizing the minimum source-sink path subject to a budget constraint, Compactness and balancing in scheduling, Unnamed Item, Separation Properties for Self-Similar Sets, On P-unique hypergraphs, Some topological indices and graph properties, Domination-related parameters in rooted product graphs, Complexity of Leading Digit Sequences, The Running Intersection Relaxation of the Multilinear Polytope, Graphs with few hamiltonian cycles, Common extremal graphs for three inequalities involving domination parameters, Persistent homology for hypergraphs and computational tools — A survey for users, CHROMATIC POLYNOMIAL OF SEMI-UNIFORM HYPERSTAR, Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances, Context-free event domains are recognizable, OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS, Unnamed Item, Unnamed Item, Broadcasting in random graphs, ON c-SPACES AND HYPERGRAPHS, Optimum matching forests I: Special weights, Optimum matching forests II: General weights, Semi-tensor product approach to networked evolutionary games, Integral decomposition in polyhedra, On the Exponent of a Primitive, Nearly Reducible Matrix. II, Coalitions of arguments: A tool for handling bipolar argumentation frameworks, The flow circulation sharing problem, NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3, The Independence Ratio and Genus of a Graph, SIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS, A Combinatorial Proof of the All Minors Matrix Tree Theorem, Nonexistence of Invariant Measures, The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs, Certain concepts of bipolar fuzzy directed hypergraphs, A degree sum condition for Hamiltonicity in balanced bipartite digraphs, Mapping schemes realizable by obstructed topological polynomials, On the vertex packing problem, Isolating the most recent entry in a random recursive tree by random cuts, Spanning tree of a multiple graph, A note on strong perfectness of graphs, Unnamed Item, Dynamic evolution of shipping network based on hypergraph, A Planarity Criterion for Graphs, On box totally dual integral polyhedra, On Invariants of Graphs with Applications to Knot Theory, Potts models and random-cluster processes with many-body interactions, On the upper critical dimension of lattice trees and lattice animals, Score lists in tripartite hypertournaments, Some Results on Chromaticity of Quasilinear Hypergraphs, Bounds on domination parameters in graphs: a brief survey, Close-to-optimal and near-optimal broadcasting in random graphs, Generalised arc consistency for the AllDifferent constraint: an empirical survey, Granulation of ecological networks under fuzzy soft environment, Any complete preference structure without circuit admits an interval representation, Unnamed Item, The Wiener index of \(r\)-uniform hypergraphs, Generalized Catalan numbers from hypergraphs, Stability for vertex cycle covers, Compatible connectedness in graphs and topological spaces, Dynamic maintenance of the transitive closure in disjunctive graphs, Preference profiles determining the proposals in the Gale-Shapley algorithm for stable matching problems, Bisecting and \(D\)-secting families for set systems, Orientations, lattice polytopes, and group arrangements. II: Modular and integral flow polynomials of graphs, Covering, Packing and Generalized Perfection, A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs, An Improved Algorithm for Finding Cycles Through Elements, Hyperpath Centers, Unnamed Item, Unnamed Item, Generating functions of some families of directed uniform hypergraphs, A Graph-Theoretical Characterisation of State Separation, Applying a hypergraph to determine the structure of some finite modules, On a generalization of the matroid, Unimodular hypergraph for DNA sequencing: a polynomial time algorithm, On the strong chromatic index of cyclic multigraphs, The \(1/N\) expansion of multi-orientable random tensor models, Multicolor routing in the undirected hypercube, The Gauss-Manin connection of the integral of the deformed difference product, Unnamed Item, Orthogonal partitions and covering of graphs, Coherent network partitions: characterizations with cographs and prime graphs, Preemptive Scheduling, Linear Programming and Network Flows, Fractional covers for forests and matchings, Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs, The subalgebra lattice of a finite algebra, The agglomeration phenomenon influence on the scaling law of the scientific collaboration system, Spectral analogues of Erdős' theorem on Hamilton-connected graphs, 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 a certain numbering of the vertices of a hypergraph, Even cycles in hypergraphs, Remarks on hyperenergetic circulant graphs, Weak edge-degree domination in hypergraphs, Fibonacci numbers in graphs with strong (1, 1, 2)-kernels, Approximation algorithm for the multicovering problem, Matroidal bijections between graphs, Coherent network partitions, Ramsey numbers of Berge-hypergraphs and related structures, Maximum Rank of Powers of a Matrix of a Given Pattern, An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs, Domination Parameters in Hypertrees, Chromatic polynomials of mixed hypercycles, Subdivision Drawings of Hypergraphs, Characterizations of optimal scalings of matrices, Degree sequences of graphs containing a cycle with prescribed length, Interval stability and interval covering property in finite posets, Spectra of random regular hypergraphs, On some characterisations of totally unimodular matrices, Domination in Digraphs, Some extensions of a hypergraph, Matchings and covers in hypergraphs, Sorting, linear time and the satisfiability problem, Unnamed Item, Hypergraph based Berge hypergraphs, A Künneth formula for finite sets, Partitioning the power set of \([n\) into \(C_k\)-free parts], On-line models and algorithms for max independent set, The analysis of free-sorting data: Beyond pairwise cooccurrences, On the Laplacian spectrum of \(k\)-uniform hypergraphs, Symmetry in domination for hypergraphs with choice, Degree based models of granular computing under fuzzy indiscernibility relations, A matrix approach to hypergraph stable set and coloring problems with its application to storing problem, Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments, On the problem of domino recognition, Identifying vital nodes in hypernetwork based on local centrality, Edge-disjoint 1-factors in powers of connected graphs, Neighborhood hypergraph model for topological data analysis, A generalization of Petersen's matching theorem, Some Graph-Colouring Theorems with Applications to Generalized Connection Networks, Ranking the Vertices of a Paired Comparison Digraph, The characterization of \(p\)-factor-critical graphs, The graph sandwich problem for 1-join composition is NP-complete, Random graphs as a model for pregeometry, Packing spanning trees in highly essentially connected graphs, Grinberg's criterion, List-colourings of graphs, Semi-duality and the cycle double cover conjecture, Crystallographic reptiles, Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications, Cayley, Marty and Schreier hypergraphs, Global multi-output decision trees for interaction prediction, Model-based inference in CHARME., On robust maximum flow with polyhedral uncertainty sets, Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks, An upper bound for families of linearly related plane convex sets, A hypergraph model for constraint logic programming and applications to bus drivers' scheduling, Probability propagation, Niche hypergraphs, Subcompletions of representable relation algebras, Nim games with arbitrary periodic moving orders, Vertex arboricity and vertex degrees, Opposition graphs are strict quasi-parity graphs, Neighborhood hypergraph based classification algorithm for incomplete information system, Algorithmic aspects of intersection graphs and representation hypergraphs, The strongly perfectness of normal product of \(t\)-perfect graphs, Recognizing intersection graphs of linear uniform hypergraphs, Helly numbers of polyominoes, Large fault-tolerant interconnection networks, A category-theoretical approach to hypergraphs, Paths with minimum range and ratio of arc lengths, The Boolean quadratic polytope: Some characteristics, facets and relatives, A new analysis of quasianalysis, An NC algorithm for Brooks' theorem, Long monochromatic Berge cycles in colored 4-uniform hypergraphs, Rounds in combinatorial search, Time slot scheduling of compatible jobs, The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true, Graph models for scheduling systems with machine saturation property, Micro-analyticity of the S-matrix and related functions, On the independence numbers of the cubes of odd cycles, Laplacian distribution and domination, The frequency of cyclic processes in biological multistate systems, A unified theory of symmetry for nonlinear resistive networks, Resource-sharing systems and hypergraph colorings, Parameterized fairness axioms on cycle-free graph games, Selective hypergraph colourings, A new linear programming algorithm - better or worse than the simplex method?, The \textsc{max quasi-independent set} problem, Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices, Link scheduling in wireless sensor networks: distributed edge-coloring revisited, On \(k\)-hypertournament matrices, Combining restarts, nogoods and bag-connected decompositions for solving csps, Partitioning multi-edge graphs, Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets, Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs, A generalization of the matrix-tree theorem, Efficient counting of degree sequences, Extending an extension of Grinberg's theorem, On the combinatorial problems which I would most like to see solved, Note on the outdegree of a node in random recursive trees, Monochromatic matchings in the shadow graph of almost complete hypergraphs, Orientations, lattice polytopes, and group arrangements I: Chromatic and tension polynomials of graphs, Fool's solitaire on joins and Cartesian products of graphs, Best monotone degree conditions for graph properties: a survey, Computational study on a PTAS for planar dominating set problem, Graph transformations for efficient structural analysis, Circuit decompositions and shortest circuit coverings of hypergraphs, Hamiltonian circuits, Hamiltonian paths and branching graphs of benzenoid systems, The flow index and strongly connected orientations, Gallai's problem on Dirac's construction, A note on an induced subgraph characterization of domination perfect graphs, On the Hamiltonicity of triple systems with high minimum degree, Supra-hereditary properties of hypergraphs, Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization, The extended global cardinality constraint: an empirical survey, 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, Minimum-weight two-connected spanning networks, Accessible single-valued neutrosophic graphs, A new decision-making method based on bipolar neutrosophic directed hypergraphs, The complexity of comparability graph recognition and coloring, Uniqueness of colorings, A note on perfect Gaussian elimination, Probabilistic graph-coloring in bipartite and split graphs, Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems, A new connection between quantum circuits, graphs and the Ising partition function, Dynamic detection of subgraphs in computer networks, Nonuniform recursive trees with vertex attraction depending on their labels, Recent trends in combinatorial optimization, NP-complete problems simplified on tree schemas, The primitivity of the strong product of two directed graphs, Deadlock-freedom in resource contentions, Computing the maximum-entropy extension of given discrete probability distributions, The sequence of upper and lower domination, independence and irredundance numbers of a graph, 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, On 1-factorizability of Cayley graphs, Bibliography on domination in graphs and some basic definitions of domination parameters
