scientific article; zbMATH DE number 3338381

From MaRDI portal
Revision as of 04:01, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5615282

zbMath0213.25702MaRDI QIDQ5615282

No author found.

Publication date: 1970


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (only showing first 100 items - show all)

Decomposable trees: A polynomial algorithm for tripodesQuasi-brittle graphs, a new class of perfectly orderable graphsA degree bound on decomposable treesA column generation approach for solving a non-temporal forest harvest model with spatial structure constraintsPolynomially solvable cases for the maximum stable set problemFaster recognition of clique-Helly and hereditary clique-Helly graphsQuasi-parity and perfect graphsEdge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubesOn 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 ordersRestricted coloring models for timetablingAbout weak connectivityOn the number of trees having \(k\) edges in common with a graph of bounded degreesA preemptive open shop scheduling problem with one resourceDeadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problemsA new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphsTiling of planar figures without gaps by dominos: graphical foundations of Thurston if algorithm, parallelization uniqueness and decomposionOn the stable marriage polytopeExtending SMT solvers with support for finite domain \texttt{alldifferent} constraintA greedy algorithm for the optimal basis problemPerfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphsCut-edges and regular factors in regular graphs of odd degreeRestrictions and preassignments in preemptive open shop schedulingA characterization of cube-hypergraphsNeighborhood conditions for balanced independent sets in bipartite graphsScheduling jobs within time windows on identical parallel machines: New model and algorithmsA general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphsSeparability generalizes Dirac's theoremMinimal graphs for matching extensionsStructure of cycles in minimal strong digraphsStructural properties of minimal strong digraphs versus treesOn two coloring problems in mixed graphsChoices and kernels in bipolar valued digraphsModeling and solving a crew assignment problem in air transportationExtremal graphs for a new upper bound on domination parameters in graphsPerfect graphs, kernels, and cores of cooperative gamesUnimodular modulesFrom kernels in directed graphs to fixed points and negative cycles in Boolean networksA mathematical programming procedure for the choice problematic.Lines in hypergraphsLearning bounds via sample width for classifiers on finite metric spacesStability number and \(f\)-factors in graphsWatching systems in graphs: an extension of identifying codesOn a generalized model of labeled graphsExact 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 graphsStable effectivity functions and perfect graphsUnique (optimal) solutions: complexity results for identifying and locating-dominating codesA survey on the distance-colouring of graphsA solvable case of image reconstruction in discrete tomographyPath colorings in bipartite graphsDes cycles et cocycles en hypergraphesSome remarks on the chromatic index of a graphRealization of a sum of sequences by a sum graphNote on isomorphic hypergraphs and some extensions of Whitney's theorem to families of setsOn the connectivity of Cayley digraphsNormal 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 dynamicsPlanar graphs are \(9/2\)-colorableNetwork companies and competitiveness: A framework for analysisProperly orderable graphsOn a game of policemen and robberMaximale stabile Punktmengen und minimale Überdeckungen gleichgewichtiger HypergraphenLe 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 equationsFixpoint strategies for deductive databasesNormal hypergraphs and the perfect graph conjectureUne classe d'hypergraphes bichromatiquesEdmonds polytopes and a hierarchy of combinatorial problemsSur le joint d'une famille de graphesHypergraphs and Sperner's theoremUne condition suffisante d'existence d'un circuit Hamiltonien dans un graphe orienteEcken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden DigraphenDenombrement des arborescences dont le graphe de comparabilite est hamiltonienVertices missed by longest paths or circuitsKantendisjunkte Wege in GraphenLex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testingShortness exponents of families of graphsÜber die Bestimmung von Kernen in endlichen GraphenGraphs with valency k, edge connectivity k, chromatic index k+1 and arbitrary girthLower bounds on the independence number in terms of the degreesExtreme degree sequences of simple graphsSome applications of graph theory to finite groupsGraphes cubiques d'indice trois, graphes cubiques isochromatiques, graphes cubiques d'indice quatreBipolar orientations revisitedOn the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical propertiesSpanning subgraphs with specified valenciesSur l'indice chromatique du graphe représentatif des arêtes d'un graphe régulierA lower bound for the independence number of a planar graphOn hypohamiltonian graphsEvery regular graph is a quasigroup graphLa reduction minimale d'un graphe à une reunion de cliquesSur les hypergraphes invariantsSome hypergraphs and packing problems associated with matrices of O's and 1'sLarge sets of wrapped Hamilton cycle decompositions of complete tripartite graphsUsing graphs for some discrete tomography problemsOn the ensemble of optimal dominating and locating-dominating codes in a graph







This page was built for publication: