scientific article; zbMATH DE number 3902654
From MaRDI portal
Publication:3680833
Recommendations
Cited in
(87)- A linear-time algorithm for finding a minimum spanning pseudoforest
- On strong digraphs with a unique minimally strong subdigraph
- The bulk-synchronous parallel random access machine
- On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
- Some operations preserving the existence of kernels
- A description of claw-free perfect graphs
- Average distance and independence number
- Different capacities of a digraph
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\)
- New extensions of kernel perfect digraphs to kernel imperfect critical digraphs
- Over testable languages
- Node packings on cocomparability graphs
- Tension-flow polynomials on graphs
- Three-dimensional orthogonal graph drawing algorithms
- Efficient collective communciation in optical networks
- Matchings in graphs and groups
- A characterization of b_e-critical trees
- A characterization of edge \(b\)-critical graphs
- Restricted assignment scheduling with resource constraints
- Coloring square-free Berge graphs
- On routing of wavebands for all-to-all communications in all-optical paths and cycles
- Graphs and recursively defined towers of function fields
- On the capacity of Boolean graph formulæ
- Graph decompositions and secret sharing schemes
- A polynomial algorithm for the strong Helly property
- A new greedoid: The family of local maximum stable sets of a forest
- Polynomials associated with nowhere-zero flows
- On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments
- Note on the game chromatic index of trees
- Combinatorial games on a graph
- The simulated trading heuristic for solving vehicle routing problems
- Optimal wavelength routing on directed fiber trees
- Centers of complex networks
- Cut-threshold graphs
- A survey on the relationship between the game of cops and robbers and other game representations
- Characterization of color patterns by dynamic \(H\)-paths
- \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs
- Sperner capacities
- Finite sets as complements of finite unions of convex sets
- A one-sided many-to-many matching problem
- Unions of digraphs which become kernel perfect
- Perfect graphs, kernels, and cores of cooperative games
- The complexity of minimum difference cover
- Strong kernel number in certain oriented cycle extension of graphs
- On \(\alpha\)-excellent graphs
- Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs
- Finite mappings and the topology of their stable sets
- A robust conservative mixed finite element method for isentropic compressible flow on pipe networks
- scientific article; zbMATH DE number 3841894 (Why is no real title available?)
- scientific article; zbMATH DE number 3843553 (Why is no real title available?)
- About the b-continuity of graphs
- Kernel perfect and critical kernel imperfect digraphs structure
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
- scientific article; zbMATH DE number 613248 (Why is no real title available?)
- On edge-\(b\)-critical graphs
- A new proof for some theorems in graph theory
- An efficient algorithm for Helly property recognition in a linear hypergraph
- scientific article; zbMATH DE number 1444491 (Why is no real title available?)
- Graphical reduction of reaction networks by linear elimination of species
- Improved parallel depth-first search in undirected planar graphs
- Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs
- Chemotaxis on networks: analysis and numerical approximation
- A new generalization of kernels in digraphs
- Some results on the the \(b\)-chromatic number in complementary prism graphs
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture
- All Circuits Enumeration in Macro-Econometric Models
- scientific article; zbMATH DE number 3215223 (Why is no real title available?)
- Construction of some repeated measurements designs
- Concurrent multicast in weighted networks
- CKI-digraphs, generalized sums and partitions of digraphs
- Finding a shortest even hole in polynomial time
- On the hardness of allocating frequencies for hybrid networks
- Complexity results on \(k\)-independence in some graph products
- Computational complexity of counting coincidences
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths
- Decomposing convex bipartite graphs into biconvex graphs and enumerating minimum weight red blue dominating sets
- In-domatic number and some operations in digraphs
- On three conjectures of Thomassen and the extremal digraphs for two conjectures of Nash-Williams
- Rewriting for symmetric monoidal categories with commutative (co)monoid structure
- Improved algorithms for perfect graphs and odd holes
- Title not available (Why is no real title available?)
- Solving a multi-objective optimization problem on combinatorial point configurations
- Connection between conjunctive capacity and structural properties of graphs
- Realizations of branched self-coverings of the 2-sphere
- On clustering tree structured data with categorical nature
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Kernels and partial line digraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680833)
