scientific article; zbMATH DE number 3341035
From MaRDI portal
Publication:5617548
Cited in
(94)- On the design of correct and optimal dynamical systems and games
- A geometric interpretation of one-dimensional quasinormal rings
- The theorem on planar graphs
- On fuzzy tree definition
- Stochastic controllability of linear systems with Markovian jumps
- Le problème d'étoiles pour graphes est NP-complèt
- Tseitin's formulas revisited
- Matching theory -- a sampler: From Dénes König to the present
- The free partially commutative Lie algebra: Bases and ranks
- On pseudounimodular matrices
- Some balanced complete block designs
- Covers, matchings and odd cycles of a graph
- Théorie des ecoulements dans les graphes orientes sans circuit
- Développements recents de la théorie des graphes
- Semantics in problem representation and search
- Étude syntaxique de certains langages solutions d'équations avec opérateurs
- Choice procedure in fuzzy multicriteria decision analysis based on pairwise comparisons
- On convex partitions of polygonal regions
- On fuzzification of some concepts of graphs
- Large Cayley graphs on an abelian group
- Efficient domination of the orientations of a graph
- Inequalities for the chromatic numbers of graphs
- Kronrod-Reeb graphs of functions on noncompact two-dimensional surfaces. II
- Random generation of DFAs
- Graphes connexes représentation des entiers et équirepartition
- Algebra - 9
- Techniques of semigroup ring theory: Artinian, perfect, and semiprimary semigroup rings
- Central ray method in the problem of preference intensity quantification based on paired comparisons
- Spectral rank monotonicity on undirected networks
- Some remarks on the chromatic index of a graph
- Representation of fragmentary structures by oriented graphs
- Packing and domination parameters in digraphs
- Dioïds and semirings: Links to fuzzy sets and other applications
- Analysis of preferential experiments
- Choices and kernels in bipolar valued digraphs
- Extremal graphs for a new upper bound on domination parameters in graphs
- Unimodular modules
- Omomorfismi fra grafi e grafi moltiplicativi
- A note upon minimal path problem
- Nucleo di una rete PERT e problema dei ritardi
- A graph theory oriented extension to ALGOL
- Graphes fortement connexes c-minimaux et graphes sans circuit co-minimaux
- Mehrdimensionale Zuordnungsprobleme und Netzwerkflüsse mit vorgegebenen Wertemengen. (Multi-dimensional assignment problems and network flows with given sets of values.)
- Sur un problème de Erdős et Hajnal
- Principles of enumeration of the number of graphs
- On computing the time complexity of transitive closure algorithms
- Network design and defence
- A greedy algorithm for maximizing a linear objective function
- Algorithmizing design of a class of combinatorial block diagrams
- scientific article; zbMATH DE number 4010544 (Why is no real title available?)
- Results and problems in the theory of doubly-stochastic matrices
- Sulla tracciabilita' di grafi finiti su superficie compatte
- Trees as level sets for pseudoharmonic functions in the plane
- scientific article; zbMATH DE number 495474 (Why is no real title available?)
- Efficiently hex-meshing things with topology
- Interval edge-colorings of composition of graphs
- On disjunctive domination in graphs
- 1-Triangle graphs and perfect neighborhood sets
- scientific article; zbMATH DE number 3210667 (Why is no real title available?)
- scientific article; zbMATH DE number 3211576 (Why is no real title available?)
- scientific article; zbMATH DE number 3217056 (Why is no real title available?)
- scientific article; zbMATH DE number 3224336 (Why is no real title available?)
- scientific article; zbMATH DE number 3224338 (Why is no real title available?)
- Application of pseudo-Boolean programming to the theory of graphs
- scientific article; zbMATH DE number 3237589 (Why is no real title available?)
- scientific article; zbMATH DE number 3241280 (Why is no real title available?)
- On chromatic number of graphs and set-systems
- scientific article; zbMATH DE number 3250267 (Why is no real title available?)
- scientific article; zbMATH DE number 3248814 (Why is no real title available?)
- scientific article; zbMATH DE number 3267979 (Why is no real title available?)
- Diagonally dominant matrices
- Flots et tensions dans un graphe
- An Algorithm for Vertex-pair Connectivity
- scientific article; zbMATH DE number 3307345 (Why is no real title available?)
- Some Basic Definitions in Graph Theory
- The group of autotopies of a digraph
- scientific article; zbMATH DE number 3366529 (Why is no real title available?)
- The minimal cost maximum matching of a graph
- scientific article; zbMATH DE number 3378944 (Why is no real title available?)
- B-valuations of graphs
- scientific article; zbMATH DE number 3390835 (Why is no real title available?)
- scientific article; zbMATH DE number 3393931 (Why is no real title available?)
- scientific article; zbMATH DE number 3420809 (Why is no real title available?)
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications
- Independence numbers of product graphs
- Formal methods for verification of websites macrostructure integrity
- BRS-compactness in networks: Theoretical considerations related to cohesion in citation graphs, collaboration networks and the internet
- A Note on Isolate Domination Number of a Cubic Graph
- Abstract interpretation of graphs
- Meta-resolution: An algorithmic formalisation
- On the unicity of solutions of problems of best approximations
- Financial systems: A few theoretical and algebraic considerations for their modeling
- Extremal perfect graphs for a bound on the domination number
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 Q5617548)
