scientific article; zbMATH DE number 3522018
From MaRDI portal
Publication:4099676
zbMath0334.05117MaRDI QIDQ4099676
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence, Inclusion-exclusion by ordering-free cancellation, Some results on characterizing the edges of connected graphs with a given domination number, Permuting matrices to avoid forbidden submatrices, A clique tree algorithm for partitioning a chordal graph into transitive subgraphs, On the \(b\)-continuity property of graphs, \(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory, Algorithmic and explicit determination of the Lovász number for certain circulant graphs, Coloring perfect degenerate graphs, \(r\)-dominating cliques in graphs with hypertree structure, Recent problems and results about kernels in directed graphs, On the optimal transversals of the odd cycles, A characterization of normal fraternally orientable perfect graphs, Powers of distance-hereditary graphs, A new class of perfect Hoàng graphs, Optimal parallel construction of prescribed tournaments, Directed Moore hypergraphs, An exact algorithm for min-max hyperstructure equipartition with a connected constraint, The order-interval hypergraph of a finite poset and the König property, Cycle packings in graphs and digraphs, The skiving stock problem and its relation to hypergraph matchings, Some properties of non-bicolorable hypergraphs and the four-color problem, Bus interconnection networks, A characterization of cube-hypergraphs, Independent sets which meet all longest paths, Kernels in a special class of digraphs, Open shop, satellite communication and a theorem by Egerváry (1931), Introduction to fuzzy hypergraphs and Hebbian structures, Thomassen's conjecture for line graphs of 3-hypergraphs, A linear time algorithm for maximum matchings in convex, bipartite graphs, Maximal intersection critical families of finite sets, Kernels in graphs with a clique-cutset, Infinite kernel perfect digraphs, The algorithmic use of hypertree structure and maximum neighbourhood orderings, Identifying defective sets using queries of small size, The structure of isomorphisms of universal hypergraphical automata, On eventual boundedness of Lotka-Volterra ecological systems, Independent sets and non-augmentable paths in generalizations of tournaments, Extremal graphs for a new upper bound on domination parameters in graphs, Balanced matrices, A characterization of \(P_{4}\)-comparability graphs, Kernels and perfectness in arc-local tournament digraphs, Asymptotic values of the Hall-ratio for graph powers, Essential points of the \(n\)-cube subset partitioning characterisation, XSAT and NAE-SAT of linear CNF classes, Clique-transversal sets and clique-coloring in planar graphs, Kernels in pretransitive digraphs., Intersecting fuzzy hypergraphs, Sparse hypergraphs: new bounds and constructions, A characterization of hypercacti, Characterization and recognition of generalized clique-Helly graphs, A new color change to improve the coloring of a graph, Unnamed Item, Homology cycles and dependent cycles of hypergraphs, Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences, Boundary of Hurwitz spaces and explicit patching, From hypertrees to arboreal quasi-ultrametrics, On the symmetric travelling salesman problem I: Inequalities, The complexity of arc-colorings for directed hypergraphs, On the orthogonal dimension of orbital sets, Hypergraphs induced by algebras of fixed type, Kernels in quasi-transitive digraphs, On a conjecture for the university timetabling problem, Augmenting forests to meet odd diameter requirements, Compatible topologies on graphs: an application to graph isomorphism problem complexity, Decomposing uniform hypergraphs into uniform hypertrees and single edges, \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs, Transfer flow graphs, Generating hard and diverse test sets for NP-hard graph problems, Optimisation and hypergraph theory, Minimax relations for the partial q-colorings of a graph, The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph, Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph, A class of perfectly contractile graphs, Approximability of the upper chromatic number of hypergraphs, A New Characterisation of Connected Hypergraphs, A note on greedy algorithms for the maximum weighted independent set problem, An implementation of the iterative proportional fitting procedure by propagation trees., The polytope of degree sequences of hypergraphs, Total dominating sequences in graphs, On unique independent sets in graphs, Capacities: From information theory to extremal set theory, On panchromatic patterns, A bicriterion objective for levelling the schedule of a mixed-model, \(JIT\) assembly process, Finite families of forbidden subgraphs for rainbow connection in graphs, An optimal parallel algorithm for maximal matching, Isometric embeddings into cube-hypergraphs, A global parallel algorithm for the hypergraph transversal problem, A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity, Cycles and transitivity by monochromatic paths in arc-coloured digraphs, Even pairs in square-free Berge graphs, Reformulation of global constraints based on constraints checkers, Line hypergraphs, Adamant digraphs, \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph, Bounds of the longest directed cycle length for minimal strong digraphs, Sequentially rejective pairwise testing procedures, On neighborhood-Helly graphs, Hypergraphs and the Clar problem in hexagonal systems, On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\), About colorings, stability and paths in directed graphs, A new method to extend kernel-perfect graphs to kernel-perfect critical graphs, A generalization of antiwebs to independence systems and their canonical facets, A characterization of Delsarte's linear programming bound as a ratio bound, Connected sequential colourings, The complexity of matching with bonds, Cost colourings of hypergraphs, Gallai graphs and anti-Gallai graphs, ERCW PRAMs and optical communication, Ensembles d'articulation d'un graphe \(\gamma\)-critique, Finding intersection models: from chordal to Helly circular-arc graphs, Matrices of zeros and ones with fixed row and column sum vectors, Spectra of uniform hypergraphs, On the complexity of enumerating pseudo-intents, \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs, A new characterization of perfect graphs, Universal sequences for complete graphs, Finding explanations of inconsistency in multi-context systems, On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes, Maximum number of edges in connected graphs with a given domination number, Extending kernel perfect digraphs to kernel perfect critical digraphs, Distances in cocomparability graphs and their powers, The smallest hard-to-color graph, Kernels in edge-coloured orientations of nearly complete graphs, On some decision problems for trace codings, A note on Farin points for rational triangular Bézier patches, On the complexity of monotone dualization and generating minimal hypergraph transversals, Analysis of approximate algorithms for edge-coloring bipartite graphs, \(\{0,1\}\) completely positive tensors and multi-hypergraphs, Solving efficiently the 0-1 multi-objective knapsack problem, Integer programs for logic constraint satisfaction, Extremal perfect graphs for a bound on the domination number, Colorings and orientations of graphs, On the SPANNING \(k\)-TREE problem, On hypergraphs having evenly distributed subhypergraphs, Qualitative independence and Sperner problems for directed graphs, \(k\)-Ordered Hamilton cycles in digraphs, Hamiltonian cycle is polynomial on cocomparability graphs, The complexity of coloring games on perfect graphs, Interactive image segmentation using probabilistic hypergraphs, Transitive orientations in bull-reducible Berge graphs, Claw-free cubic graphs with clique-transversal number half of their order, Treewidth computations. I: Upper bounds, Pósa-condition and nowhere-zero 3-flows, On minimally \(b\)-imperfect graphs, Kernels by monochromatic paths in digraphs with covering number 2, Antitwins in partitionable graphs, Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry, Equipartite colorings in graphs and hypergraphs, Kernels and some operations in edge-coloured digraphs, A Turan type problem for interval graphs, Bounds for the covering number of a graph, A unified treatment of nearly reducible and nearly decomposable matrices, Dominating sequences in graphs, Minimum partition of an independence system into independent sets, Fuzzy transversals of fuzzy hypergraphs, Some sufficient conditions for the existence of kernels in infinite digraphs, Cube intersection concepts in median graphs, Numerical characterization of \(n\)-cube subset partitioning, Independent sets in bounded-degree hypergraphs, Efficient algorithms for wavelength assignment on trees of rings, Linear CNF formulas and satisfiability, Random generation of tournaments and asymmetric graphs with given out-degrees, Linear programs for constraint satisfaction problems, Tensors, matchings and codes, Fuzzy colorings of fuzzy hypergraphs, A survey on the complexity of tournament solutions, On the complexity of Slater's problems, Packing and covering k-chain free subsets in Boolean lattices, Sequential colorings and perfect graphs, A sequential coloring algorithm for finite sets, A class of hypergraphs satisfying an inequality of Lovasz, Pseudo-chordal mixed hypergraphs, A cell formation algorithm: Hypergraph approximation -- cut tree, Mutual placement of bipartite graphs, Graphs and free partially commutative monoids, Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs, Dominating cliques in chordal graphs, Largest size and union of Helly families
