scientific article; zbMATH DE number 3338381
From MaRDI portal
Publication:5615282
zbMath0213.25702MaRDI QIDQ5615282
No author found.
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 (only showing first 100 items - show all)
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
This page was built for publication: