scientific article; zbMATH DE number 3522018
From MaRDI portal
Publication:4099676
Cited in
(only showing first 100 items - show all)- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
- A Turan type problem for interval graphs
- A characterization of Delsarte's linear programming bound as a ratio bound
- \(r\)-dominating cliques in graphs with hypertree structure
- Spectra of uniform hypergraphs
- On the \(b\)-continuity property of graphs
- Clique-transversal sets and clique-coloring in planar graphs
- A unified treatment of nearly reducible and nearly decomposable matrices
- Kernels and some operations in edge-coloured digraphs
- Augmenting forests to meet odd diameter requirements
- Reformulation of global constraints based on constraints checkers
- On the complexity of Slater's problems
- Numerical characterization of \(n\)-cube subset partitioning
- Gallai graphs and anti-Gallai graphs
- Kernels by monochromatic paths in digraphs with covering number 2
- On neighborhood-Helly graphs
- Matrices of zeros and ones with fixed row and column sum vectors
- From hypertrees to arboreal quasi-ultrametrics
- Random generation of tournaments and asymmetric graphs with given out-degrees
- Some sufficient conditions for the existence of kernels in infinite digraphs
- Powers of distance-hereditary graphs
- Kernels in quasi-transitive digraphs
- On the symmetric travelling salesman problem I: Inequalities
- On the SPANNING \(k\)-TREE problem
- \(k\)-Ordered Hamilton cycles in digraphs
- On minimally \(b\)-imperfect graphs
- A new characterization of perfect graphs
- Cycle packings in graphs and digraphs
- Interactive image segmentation using probabilistic hypergraphs
- Capacities: From information theory to extremal set theory
- A linear time algorithm for maximum matchings in convex, bipartite graphs
- Essential points of the \(n\)-cube subset partitioning characterisation
- Treewidth computations. I: Upper bounds
- A characterization of normal fraternally orientable perfect graphs
- Maximum number of edges in connected graphs with a given domination number
- Finding intersection models: from chordal to Helly circular-arc graphs
- Dominating sequences in graphs
- XSAT and NAE-SAT of linear CNF classes
- Compatible topologies on graphs: an application to graph isomorphism problem complexity
- The order-interval hypergraph of a finite poset and the König property
- A note on greedy algorithms for the maximum weighted independent set problem
- Independent sets which meet all longest paths
- Permuting matrices to avoid forbidden submatrices
- Kernels in edge-coloured orientations of nearly complete graphs
- The polytope of degree sequences of hypergraphs
- \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs
- Finding explanations of inconsistency in multi-context systems
- Pósa-condition and nowhere-zero 3-flows
- Extremal graphs for a new upper bound on domination parameters in graphs
- Solving efficiently the 0-1 multi-objective knapsack problem
- On the complexity of enumerating pseudo-intents
- Isometric embeddings into cube-hypergraphs
- A survey on the complexity of tournament solutions
- Independent sets in bounded-degree hypergraphs
- On the orthogonal dimension of orbital sets
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Colorings and orientations of graphs
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- A generalization of antiwebs to independence systems and their canonical facets
- Cycles and transitivity by monochromatic paths in arc-coloured digraphs
- Even pairs in square-free Berge graphs
- Fuzzy colorings of fuzzy hypergraphs
- Recent problems and results about kernels in directed graphs
- \(\{0,1\}\) completely positive tensors and multi-hypergraphs
- Independent sets and non-augmentable paths in generalizations of tournaments
- Kernels in a special class of digraphs
- \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph
- A class of perfectly contractile graphs
- Transitive orientations in bull-reducible Berge graphs
- Claw-free cubic graphs with clique-transversal number half of their order
- Balanced matrices
- The complexity of arc-colorings for directed hypergraphs
- Total dominating sequences in graphs
- Sparse hypergraphs: new bounds and constructions
- Linear CNF formulas and satisfiability
- Tensors, matchings and codes
- On panchromatic patterns
- The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph
- Finite families of forbidden subgraphs for rainbow connection in graphs
- An optimal parallel algorithm for maximal matching
- Characterization and recognition of generalized clique-Helly graphs
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes
- A characterization of \(P_{4}\)-comparability graphs
- Dominating cliques in chordal graphs
- Mutual placement of bipartite graphs
- Line hypergraphs
- On a conjecture for the university timetabling problem
- An implementation of the iterative proportional fitting procedure by propagation trees.
- Universal sequences for complete graphs
- Extending kernel perfect digraphs to kernel perfect critical digraphs
- Coloring perfect degenerate graphs
- Packing and covering k-chain free subsets in Boolean lattices
- A class of hypergraphs satisfying an inequality of Lovasz
- On unique independent sets in graphs
- Asymptotic values of the Hall-ratio for graph powers
- Kernels and perfectness in arc-local tournament digraphs
- A note on Farin points for rational triangular Bézier patches
- Infinite kernel perfect digraphs
- Graphs and free partially commutative monoids
- Cost colourings of hypergraphs
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)
