scientific article
From MaRDI portal
Publication:3680833
zbMath0566.05001MaRDI QIDQ3680833
No author found.
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)
Related Items (71)
Average distance and independence number ⋮ On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments ⋮ Different capacities of a digraph ⋮ Perfect graphs with no \(P_ 5\) and no \(K_ 5\) ⋮ Sperner capacities ⋮ Note on the game chromatic index of trees ⋮ Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs ⋮ New extensions of kernel perfect digraphs to kernel imperfect critical digraphs ⋮ A linear-time algorithm for finding a minimum spanning pseudoforest ⋮ Over testable languages ⋮ Improved parallel depth-first search in undirected planar graphs ⋮ All Circuits Enumeration in Macro-Econometric Models ⋮ Unnamed Item ⋮ On strong digraphs with a unique minimally strong subdigraph ⋮ Finite sets as complements of finite unions of convex sets ⋮ Combinatorial games on a graph ⋮ A one-sided many-to-many matching problem ⋮ The simulated trading heuristic for solving vehicle routing problems ⋮ Matchings in graphs and groups ⋮ Centers of complex networks ⋮ The bulk-synchronous parallel random access machine ⋮ Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3 ⋮ Realizations of branched self-coverings of the 2-sphere ⋮ Finding a shortest even hole in polynomial time ⋮ Unions of digraphs which become kernel perfect ⋮ Node packings on cocomparability graphs ⋮ On \(\alpha\)-excellent graphs ⋮ A characterization of \(b_e\)-critical trees ⋮ A characterization of edge \(b\)-critical graphs ⋮ Perfect graphs, kernels, and cores of cooperative games ⋮ Chemotaxis on networks: Analysis and numerical approximation ⋮ Restricted assignment scheduling with resource constraints ⋮ Tension-flow polynomials on graphs ⋮ Optimal wavelength routing on directed fiber trees ⋮ Coloring square-free Berge graphs ⋮ On edge-\(b\)-critical graphs ⋮ The complexity of minimum difference cover ⋮ On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs ⋮ Graphical reduction of reaction networks by linear elimination of species ⋮ On clustering tree structured data with categorical nature ⋮ Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs ⋮ A new generalization of kernels in digraphs ⋮ Finite mappings and the topology of their stable sets ⋮ Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture ⋮ An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph ⋮ Construction of some repeated measurements designs ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ On routing of wavebands for all-to-all communications in all-optical paths and cycles ⋮ Concurrent multicast in weighted networks ⋮ Graphs and recursively defined towers of function fields ⋮ Cut-threshold graphs ⋮ Kernels and partial line digraphs ⋮ A survey on the relationship between the game of cops and robbers and other game representations ⋮ CKI-digraphs, generalized sums and partitions of digraphs ⋮ Strong kernel number in certain oriented cycle extension of graphs ⋮ On the capacity of Boolean graph formulæ ⋮ Connection between conjunctive capacity and structural properties of graphs ⋮ Three-dimensional orthogonal graph drawing algorithms ⋮ Characterization of color patterns by dynamic \(H\)-paths ⋮ Efficient collective communciation in optical networks ⋮ Some results on the b-chromatic number in complementary prism graphs ⋮ Graph decompositions and secret sharing schemes ⋮ A polynomial algorithm for the strong Helly property ⋮ Some operations preserving the existence of kernels ⋮ A new greedoid: The family of local maximum stable sets of a forest ⋮ Polynomials associated with nowhere-zero flows ⋮ A Robust Conservative Mixed Finite Element Method for Isentropic Compressible Flow on Pipe Networks ⋮ A description of claw-free perfect graphs ⋮ \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs ⋮ About the b-continuity of graphs ⋮ Kernel perfect and critical kernel imperfect digraphs structure
This page was built for publication:
