scientific article; zbMATH DE number 3338381
From MaRDI portal
zbMath0213.25702MaRDI QIDQ5615282
Publication date: 1970
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
A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing, Chromatic scheduling and frequency assignment, Algorithmic characterizations of interval orderd hypergraphs and applications, Compatibility between interval structures and partial orderings, The struction algorithm for the maximum stable set problem revisited, Persistency in maximum cardinality bipartite matchings, Methods and problems of communication in usual networks, Isometric embeddings into cube-hypergraphs, Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid, A note on visibility graphs, A note on minimal directed graphs with given girth, On the problem of how to represent a graph taking into account an additional structure, Generalized neighbourhoods and a class of perfectly orderable graphs, Graphical partially ordered sets, Locally perfect graphs, On the two-phase method for preemptive scheduling, A discrete solenoidal finite difference scheme for the numerical approximation of incompressible flows, Some models of graphs for scheduling sports competitions, A fast algorithm for coloring Meyniel graphs, A decomposition method for minimizing quadratic pseudo-Boolean functions, On the Penrose number of cubic diagrams, Deterministic synchronization of automata with bounded delay, Flows and generalized coloring theorems in graphs, Interval matroids and graphs, Zur Theorie der perfekten Graphen, On maximal independent sets of vertices in claw-free graphs, Alcuni risultati sulla teoria degli ipergrafi, Sur le spectre des opérateurs aux différences finies aléatoires, On critically h-connected simple graphs, About the shortest chain between two vertices in a quasi strongly connected digraph with a potential, Reconstruction theorems for graph enumerating polynomials, On multiply critically h-connected graphs, Décomposition de \(K_ m\) + \(K_ n\) en cycles hamiltoniens, An application of connectivity theory in graphs to factorizations of elements in groups, Sous-graphes tracables des graphes infinis, Décomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens, Couplages et transversaux généralises d'un hypergraphe infini, A constructive approach to the critical problem for matroids, Another characterization of hypercubes, Parallel realization of permutations over trees, On the enumeration of chains in regular chain-groups, Sur la cardinalite maximum des couplages d'hypergraphes aléatoires uniformes, Optimal implementation of selectors in a data-base, A normalization theorem for regular homotopy of finite directed graphs, Evaluations asymptotiques du nombre des cliques des hypergraphes uniformes, On a conjecture of Entringer and Slater, k-optimal partitions of a directed graph, On the existence of 2-designs Slambda(2,3,v) without repeated blocks, Transitive multipermutation graphs: Case \(4\leq n\leq m\), A Sperner-type theorem and qualitative independence, Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource, Graphs and topologies on discrete sets, The connectivity of hierarchical Cayley digraphs, Qualitative independence and Sperner problems for directed graphs, Numero cromatico, omomorfismi e colorazioni d'ungrafo, On parity patterns of even \(q\)-angulations, Hypermaps versus bipartite maps, Un algorithme combinatoire pour la résolution des problèmes du type du permanent, Random hypertrees and hyperforests, Some remarks on good colorations, Un problème extremal pour les graphes et les hypergraphes, Nombres de coloration de l'hypergraphe h-parti complet, Complexite et circuits euleriens dans les sommes tensorielles de graphes, Some observations on the determination of an upper bound for the clique number of a graph, Groupes de permutations primitifs d'ordre impair et denombrement de tournois sommet-primitifs, On decomposition of r-partite graphs into edge-disjoint Hamilton circuits, Éléments ipsoduaux du treillis distributif libre et familles de Sperner ipsotransversales, Théorie des ecoulements dans les graphes orientes sans circuit, Multicolorings, measures and games on graphs, Cycles Hamiltoniens dans les graphes 4-réguliers 4-connexes, Développements recents de la théorie des graphes, The intersection numbers of a complex, Un metodo canonico di riduzione e costruzione relativo a grafi planari massimali, Degrees and independent sets of hypergraphs, Le nombre maximal de colorations d'un graphe Hamiltonien, A procedure to determine optimal partitions of weighted hypergraphs through a network-flow analogy, Directed recursive labelnode hypergraphs: A new representation-language, Almost integral polyhedra related to certain combinatorial optimization problems, A problem on triples, Amas dans les graphes planaires, Sur le nombre transversal des hypergraphes uniformes, On Turan hypergraphs, Su di un problema di A. M. Hobbs, On the perfect graph conjecture, Les 5-colorations d'un graphe planaire forment une classe de commutation unique, Sur les cycles élémentaires dans les graphes et hypergraphes k- chromatiques, Hypergraphes arbores, Tree representations of ternary relations, Zur Struktur minimal n-fach zusammenhängender Graphen, Upper embeddability and connectivity of graphs, Smallest 3-graphs having a 3-colored edge in every k-coloring, On directed graphs with an independent covering set, Extensions of coloring models for scheduling purposes, Stable trace automata vs. full trace automata, Stable families of coalitions and normal hypergraphs, The combinatorics of timetabling, Context-free event domains are recognizable, On a multiconstrained model for chromatic scheduling, Symmetric flows and broadcasting in hypercubes, On perfectness of sums of graphs, Decomposable trees: A polynomial algorithm for tripodes, Quasi-brittle graphs, a new class of perfectly orderable graphs, A degree bound on decomposable trees, A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints, Polynomially solvable cases for the maximum stable set problem, Faster recognition of clique-Helly and hereditary clique-Helly graphs, Quasi-parity and perfect graphs, Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes, On polynomial functions from \(\mathbb{Z}_{n_ 1}\times \mathbb{Z}_{n_ 2}\times \cdots \times \mathbb{Z}_{n_ r}\) to \(\mathbb{Z}_ m\), New results on the computation of median orders, Restricted coloring models for timetabling, About weak connectivity, On the number of trees having \(k\) edges in common with a graph of bounded degrees, A preemptive open shop scheduling problem with one resource, Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems, A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs, Tiling of planar figures without gaps by dominos: graphical foundations of Thurston if algorithm, parallelization uniqueness and decomposion, On the stable marriage polytope, Extending SMT solvers with support for finite domain \texttt{alldifferent} constraint, A greedy algorithm for the optimal basis problem, Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs, Cut-edges and regular factors in regular graphs of odd degree, Restrictions and preassignments in preemptive open shop scheduling, A characterization of cube-hypergraphs, Neighborhood conditions for balanced independent sets in bipartite graphs, Scheduling jobs within time windows on identical parallel machines: New model and algorithms, A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs, Separability generalizes Dirac's theorem, Minimal graphs for matching extensions, Structure of cycles in minimal strong digraphs, Structural properties of minimal strong digraphs versus trees, On two coloring problems in mixed graphs, Choices and kernels in bipolar valued digraphs, Modeling and solving a crew assignment problem in air transportation, Extremal graphs for a new upper bound on domination parameters in graphs, Perfect graphs, kernels, and cores of cooperative games, Unimodular modules, From kernels in directed graphs to fixed points and negative cycles in Boolean networks, A mathematical programming procedure for the choice problematic., Lines in hypergraphs, Learning bounds via sample width for classifiers on finite metric spaces, Stability number and \(f\)-factors in graphs, Watching systems in graphs: an extension of identifying codes, On a generalized model of labeled graphs, Exact partition functions and correlation functions of multiple Hamiltonian walks on the Manhattan lattice., Job contact networks., On the complexity of the selective graph coloring problem in some special classes of graphs, Stable effectivity functions and perfect graphs, Unique (optimal) solutions: complexity results for identifying and locating-dominating codes, A survey on the distance-colouring of graphs, A solvable case of image reconstruction in discrete tomography, Path colorings in bipartite graphs, Des cycles et cocycles en hypergraphes, Some remarks on the chromatic index of a graph, Realization of a sum of sequences by a sum graph, Note on isomorphic hypergraphs and some extensions of Whitney's theorem to families of sets, On the connectivity of Cayley digraphs, Normal hypergraphs and the perfect graph conjecture. (Reprint), Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint), Spanning subgraphs with specified valencies. (Reprint), ``Immunetworks, intersecting circuits and dynamics, Planar graphs are \(9/2\)-colorable, Network companies and competitiveness: A framework for analysis, Properly orderable graphs, On a game of policemen and robber, Maximale stabile Punktmengen und minimale Überdeckungen gleichgewichtiger Hypergraphen, Le nombre maximal de 3-colorations d'un graphe connexe. (The maximal number of 3-colorations of a connected graph), Translation of logic programs into functional fixpoint equations, Fixpoint strategies for deductive databases, Normal hypergraphs and the perfect graph conjecture, Une classe d'hypergraphes bichromatiques, Edmonds polytopes and a hierarchy of combinatorial problems, Sur le joint d'une famille de graphes, Hypergraphs and Sperner's theorem, Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente, Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen, Denombrement des arborescences dont le graphe de comparabilite est hamiltonien, Vertices missed by longest paths or circuits, Kantendisjunkte Wege in Graphen, Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing, Shortness exponents of families of graphs, Über die Bestimmung von Kernen in endlichen Graphen, Graphs with valency k, edge connectivity k, chromatic index k+1 and arbitrary girth, Lower bounds on the independence number in terms of the degrees, Extreme degree sequences of simple graphs, Some applications of graph theory to finite groups, Graphes cubiques d'indice trois, graphes cubiques isochromatiques, graphes cubiques d'indice quatre, Bipolar orientations revisited, On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties, Spanning subgraphs with specified valencies, Sur l'indice chromatique du graphe représentatif des arêtes d'un graphe régulier, A lower bound for the independence number of a planar graph, On hypohamiltonian graphs, Every regular graph is a quasigroup graph, La reduction minimale d'un graphe à une reunion de cliques, Sur les hypergraphes invariants, Some hypergraphs and packing problems associated with matrices of O's and 1's, Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs, Using graphs for some discrete tomography problems, On the ensemble of optimal dominating and locating-dominating codes in a graph, On Tutte polynomials and cycles of plane graphs, Bipartable graphs, Quelques utilisations de la STRUCTION. (Some applications of STRUCTION), A note on superbrittle graphs, The Copeland choice function. An axiomatic characterization, Partitions of digraphs into paths or circuits, On randomized stopping points and perfect graphs, Generating stable permutations, Sur la contraction des graphes orientés en \(K^ *_ 3\). (On the contraction of digraphs onto \(K^ *_ 3)\), Large induced degenerate subgraphs, Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number, On a relationship between Hadwiger and stability numbers, Planar graphs have independence ratio at least 3/13, On the null-homotopy of graphs, On neighborhood-Helly graphs, Basis graphs of even delta-matroids, Hypergraphs and the Clar problem in hexagonal systems, On the identifiability of linear compartmental systems: A revisited transfer function approach based on topological properties, All minimal prime extensions of hereditary classes of graphs, Hypernetworks as tools for modelling multiport systems, A characterization of the graphs in which the transversal number equals the matching number, Global constraint catalogue: past, present and future, On mean distance and girth, Addendum to ``Finding all maximally-matchable edges in a bipartite graph, On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs, Minimal strong digraphs, The colorful Helly theorem and general hypergraphs, Generalized Hamming weights and some parameterized codes, On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems, A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule, Bipolarizable graphs, On the sizes of graphs and their powers: the undirected case, Almost all digraphs have a kernel, \(k\)-linked and \(k\)-cyclic digraphs, Cycles and paths of many lengths in bipartite digraphs, New decision rules for exact search in \(N\)-queens, A counterexample to sparse removal, On the number of optimal identifying codes in a twin-free graph, RUBIS: a bipolar-valued outranking method for the choice problem, Optimal broadcasting in the back to back d-ary trees, Medians and centres of polyominoes, Facet defining inequalities among graph invariants: The system graphedron, Binary clustering, Stability of two player game structures, Negative local feedbacks in Boolean networks, Applying a condition for a Hamiltonian bipartite graph to be bipancyclic, Autonomous parts and decomposition of regular tournaments, Median graphs, parallelism and posets, Bounded vertex colorings of graphs, On some partial line graphs of a hypergraph and the associated matroid, The cyclic compact open-shop scheduling problem, Animaux et arbres guingois. (Animals and guingois trees), Finding induced trees, Frustration and overblocking on graphs, Series-parallel chromatic hypergraphs, Complexity of two coloring problems in cubic planar bipartite mixed graphs, Disjoint cycles and spanning graphs of hypercubes, Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs, Some new hereditary classes where graph coloring remains NP-hard, Hamiltonian decompositions of complete \(k\)-uniform hypergraphs, Skeletal graphs - a new class of perfect graphs, Cyclic orders, Uniqueness of the perfect fusion grid on \(\mathbb{Z}^d\), A survey of known results and research areas for \(n\)-queens, Preemptive scheduling and antichain polyhedra, Weighted fusion graphs: Merging properties and watersheds, Fusion graphs: merging properties and watersheds, The complexity of clique graph recognition, Une classe d'hypergraphes bichromatiques. II, An introduction to timetabling, Representation theorems for graphs whose vertex set is partially ordered, Graph coloring with cardinality constraints on the neighborhoods, On shadowed hypergraphs, Mixed graph edge coloring, Blockers and transversals, Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid, On the notion of cycles in hypergraphs, Duality theorems for regular homotopy of finite directed graphs, A note on the girth of digraphs, Arbres minimaux d'un graphe preordonne, Nowhere-zero integral flows on a bidirected graph, Transversals of circuits and acyclic orientations in graphs and matroids, Graphes de cordes et espaces graphiques, The 1-factorization of some line-graphs, Sur la séparation dans les graphes de Cayley abéliens, On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\), Un problème de connectivité sur les espaces métriques, Estimates of general Mayer graphs. I. Construction of upper bounds for a given graph by means of sets of subgraphs. III. Upper bounds obtained by means of spanning n-trees. IV. On the computation of Gaussian integrals by star-mesh transformation, Component structure in the evolution of random hypergraphs, Pancyclism in hamiltonian graphs, A three-dimensional quadratic nonconforming element, Semigroups characterizing hypergraphs, A bound for the Dilworth number, On the pseudo-steady-state approximation and Tikhonov theorem for general enzyme systems, Efficient polynomial algorithms for distributive lattices, Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions, On shortest cocycle covers of graphs, A convoy scheduling problem, Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés, On the Shannon capacity of a directed graph, A Uniform Set Covering Lemma, Unnamed Item, Threshold Sequences, 1998 European Summer Meeting of the Association for Symbolic Logic, Unnamed Item, Remarks on regular factors of regular graphs, On Vertices of outdegree n in minimally n‐connected digraphs, Topological Krasner hyperrings with special emphasis on isomorphism theorems, Stratified petri nets, Unnamed Item, Transforming Graphs with the Same Degree Sequence, The adjacency graphs of a complex, On Disjoint Partial Quadruple Systems having Seventeen Blocks, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Polynomial algorithms for the synthesis of bounded nets, The combinatorial complexity of a finite string, The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs, Matchings in 1‐planar graphs with large minimum degree, 3‐Degenerate induced subgraph of a planar graph, Switching checkerboards in \((0,1)\)-matrices, Brève communication. Une caractérisation des graphes $k-$chromatiques minimaux sans sommet isolé, Circuits et arbres de circulation d'un graphe fortement connexe, Partitioning into common independent sets via relaxing strongly base orderability, Computing partial hypergraphs of bounded width, A novel connection between rough sets, hypergraphs and hypergroups, Quasi-balanced matrices, Generalized colourings for caterpillars, Un algorithme de détermination de couvertures de cardinal minimal, Unnamed Item, 3-Colorability of plane hypergraphs, Lower and upper bounds for the linear arrangement problem on interval graphs, Dépliage d'un graphe pointé en un cactus, Bicolored matchings in some classes of graphs, Unnamed Item, Quasi balanced matrices — An addendum, Study of L(s, s)-colouring for caterpillars, A note on permanents, Local optimality subsets and global optimization: A prospective approach, Large Sets of Wrapped K–K Hamilton Cycle Decompositions of Complete Bipartite 3‐Uniform Hypergraphs, Convexity and global optimization: A theoretical link, A counter-example to a lemma about embedding starlike trees into hypercube, Unnamed Item, Unnamed Item, Una variante del algoritmo de Edmonds para acoplamientos Maximos, Uniform emulations of Cartesian-product and Cayley graphs, Cohomomorphisms of graphs and hypergraphs, Subdivisions de surfaces et cartes généralisées de dimension 2, Unnamed Item, Sur le problème des mots des quotients de groupes et produits libres, Path decompositions of digraphs, Unnamed Item, BARYCENTRIC ENTROPY OF MARKOV SYSTEMS, On the distribution of winning moves in random game trees, Note on Turán's graph, Partial matching for analogy discovery in proofs and counter-examples, A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm, Hamiltonian Berge cycles in random hypergraphs, Rank of maximum matchings in a graph, A note on graph colouring, Quasi-order Γ-semihypergroups: Fundamental relations and complete parts, Degree Sequences in Complexes and Hypergraphs, The Colorful Helly Property for Hypergraphs, Minimizing the channel width for a linear arrangement of elements of discrete systems, Unnamed Item, Frutex y caminos nodales, Réduction de la résolution d'un problème de réseau maillé (B) : sur la convergence locale de certaines méthodes, Balanced matrices, On the parameterm2(h) for graphs, Réduction de la résolution d'un problème de réseau maillé, Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs, Hypergroups constructed from hypergraphs, Vertices Belonging to All or to No Maximum Stable Sets of a Graph
