scientific article; zbMATH DE number 3522018
From MaRDI portal
Publication:4099676
Cited in
(only showing first 100 items - show all)- Introduction to fuzzy hypergraphs and Hebbian structures
- Dominating cliques in chordal graphs
- Mutual placement of bipartite graphs
- Graphs and free partially commutative monoids
- On unique independent sets in graphs
- Characterization and recognition of generalized clique-Helly graphs
- The structure of isomorphisms of universal hypergraphical automata
- ERCW PRAMs and optical communication
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
- Kernels and some operations in edge-coloured digraphs
- Universal sequences for complete graphs
- Numerical characterization of \(n\)-cube subset partitioning
- A class of perfectly contractile graphs
- A New Characterisation of Connected Hypergraphs
- A characterization of \(P_{4}\)-comparability graphs
- On hypergraphs having evenly distributed subhypergraphs
- Asymptotic values of the Hall-ratio for graph powers
- Kernels and perfectness in arc-local tournament digraphs
- Total dominating sequences in graphs
- Transitive orientations in bull-reducible Berge graphs
- Claw-free cubic graphs with clique-transversal number half of their order
- On eventual boundedness of Lotka-Volterra ecological systems
- Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- Decomposing uniform hypergraphs into uniform hypertrees and single edges
- Spectra of uniform hypergraphs
- Generating hard and diverse test sets for NP-hard graph problems
- A new characterization of perfect graphs
- Finding intersection models: from chordal to Helly circular-arc graphs
- Extremal perfect graphs for a bound on the domination number
- The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence
- A note on Farin points for rational triangular Bézier patches
- Coloring perfect degenerate graphs
- Clique-transversal sets and clique-coloring in planar graphs
- scientific article; zbMATH DE number 7637234 (Why is no real title available?)
- Adamant digraphs
- Bounds of the longest directed cycle length for minimal strong digraphs
- The complexity of arc-colorings for directed hypergraphs
- A characterization of Delsarte's linear programming bound as a ratio bound
- Dominating sequences in graphs
- A characterization of normal fraternally orientable perfect graphs
- The order-interval hypergraph of a finite poset and the König property
- Linear programs for constraint satisfaction problems
- Independent sets in bounded-degree hypergraphs
- A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity
- Tensors, matchings and codes
- On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\)
- Kernels by monochromatic paths in digraphs with covering number 2
- Reformulation of global constraints based on constraints checkers
- Fuzzy transversals of fuzzy hypergraphs
- Kernels in edge-coloured orientations of nearly complete graphs
- The polytope of degree sequences of hypergraphs
- A global parallel algorithm for the hypergraph transversal problem
- Kernels in a special class of digraphs
- A characterization of hypercacti
- On the complexity of Slater's problems
- \(k\)-Ordered Hamilton cycles in digraphs
- Interactive image segmentation using probabilistic hypergraphs
- k-kernels in k-transitive and k-quasi-transitive digraphs
- A survey on the complexity of tournament solutions
- A generalization of antiwebs to independence systems and their canonical facets
- About colorings, stability and paths in directed graphs
- The complexity of matching with bonds
- A new class of perfect Hoàng graphs
- Fuzzy colorings of fuzzy hypergraphs
- Homology cycles and dependent cycles of hypergraphs
- On the SPANNING k-TREE problem
- A unified treatment of nearly reducible and nearly decomposable matrices
- Some sufficient conditions for the existence of kernels in infinite digraphs
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- Finding explanations of inconsistency in multi-context systems
- Hypergraphs and the Clar problem in hexagonal systems
- Sequential colorings and perfect graphs
- On panchromatic patterns
- Finite families of forbidden subgraphs for rainbow connection in graphs
- Some results on characterizing the edges of connected graphs with a given domination number
- Cube intersection concepts in median graphs
- Inclusion-exclusion by ordering-free cancellation
- Sequentially rejective pairwise testing procedures
- A new method to extend kernel-perfect graphs to kernel-perfect critical graphs
- On minimally \(b\)-imperfect graphs
- Independent sets which meet all longest paths
- Essential points of the \(n\)-cube subset partitioning characterisation
- XSAT and NAE-SAT of linear CNF classes
- Directed Moore hypergraphs
- Maximum number of edges in connected graphs with a given domination number
- Matrices of zeros and ones with fixed row and column sum vectors
- Some properties of non-bicolorable hypergraphs and the four-color problem
- A note on greedy algorithms for the maximum weighted independent set problem
- Thomassen's conjecture for line graphs of 3-hypergraphs
- Pseudo-chordal mixed hypergraphs
- Optimal parallel construction of prescribed tournaments
- On the optimal transversals of the odd cycles
- Cost colourings of hypergraphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Minimum partition of an independence system into independent sets
- A cell formation algorithm: Hypergraph approximation -- cut tree
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint
- Solving efficiently the 0-1 multi-objective knapsack problem
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes
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 Q4099676)
