scientific article; zbMATH DE number 3522018
From MaRDI portal
Publication:4099676
Cited in
(only showing first 100 items - show all)- Minimum partition of an independence system into independent sets
- Some sufficient conditions for the existence of kernels in infinite digraphs
- Cube intersection concepts in median graphs
- Numerical characterization of \(n\)-cube subset partitioning
- Independent sets in bounded-degree hypergraphs
- Efficient algorithms for wavelength assignment on trees of rings
- Linear CNF formulas and satisfiability
- A survey on the complexity of tournament solutions
- On the complexity of Slater's problems
- Packing and covering k-chain free subsets in Boolean lattices
- A class of hypergraphs satisfying an inequality of Lovasz
- Adamant digraphs
- Bounds of the longest directed cycle length for minimal strong digraphs
- Sequentially rejective pairwise testing procedures
- About colorings, stability and paths in directed graphs
- A new method to extend kernel-perfect graphs to kernel-perfect critical graphs
- A generalization of antiwebs to independence systems and their canonical facets
- Connected sequential colourings
- The complexity of matching with bonds
- Gallai graphs and anti-Gallai graphs
- ERCW PRAMs and optical communication
- Ensembles d'articulation d'un graphe -critique
- Matrices of zeros and ones with fixed row and column sum vectors
- Maximum number of edges in connected graphs with a given domination number
- Extending kernel perfect digraphs to kernel perfect critical digraphs
- Distances in cocomparability graphs and their powers
- The smallest hard-to-color graph
- Integer programs for logic constraint satisfaction
- Colorings and orientations of graphs
- Qualitative independence and Sperner problems for directed graphs
- Hamiltonian cycle is polynomial on cocomparability graphs
- The complexity of coloring games on perfect graphs
- Antitwins in partitionable graphs
- Equipartite colorings in graphs and hypergraphs
- A Turan type problem for interval graphs
- Bounds for the covering number of a graph
- A unified treatment of nearly reducible and nearly decomposable matrices
- Fuzzy transversals of fuzzy hypergraphs
- Random generation of tournaments and asymmetric graphs with given out-degrees
- Linear programs for constraint satisfaction problems
- Fuzzy colorings of fuzzy hypergraphs
- Sequential colorings and perfect graphs
- A sequential coloring algorithm for finite sets
- Pseudo-chordal mixed hypergraphs
- A cell formation algorithm: Hypergraph approximation -- cut tree
- Mutual placement of bipartite graphs
- Dominating cliques in chordal graphs
- Largest size and union of Helly families
- On unique independent sets in graphs
- Capacities: From information theory to extremal set theory
- A bicriterion objective for levelling the schedule of a mixed-model, JIT assembly process
- An optimal parallel algorithm for maximal matching
- Isometric embeddings into cube-hypergraphs
- A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity
- Line hypergraphs
- Coloring perfect degenerate graphs
- \(r\)-dominating cliques in graphs with hypertree structure
- On the optimal transversals of the odd cycles
- A characterization of normal fraternally orientable perfect graphs
- The order-interval hypergraph of a finite poset and the König property
- Kernels in a special class of digraphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Kernels in pretransitive digraphs.
- An implementation of the iterative proportional fitting procedure by propagation trees.
- The polytope of degree sequences of hypergraphs
- Inclusion-exclusion by ordering-free cancellation
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint
- The skiving stock problem and its relation to hypergraph matchings
- Homology cycles and dependent cycles of hypergraphs
- From hypertrees to arboreal quasi-ultrametrics
- On the orthogonal dimension of orbital sets
- Transfer flow graphs
- Generating hard and diverse test sets for NP-hard graph problems
- Optimisation and hypergraph theory
- Minimax relations for the partial q-colorings of a graph
- A note on greedy algorithms for the maximum weighted independent set problem
- Some results on characterizing the edges of connected graphs with a given domination number
- Permuting matrices to avoid forbidden submatrices
- A clique tree algorithm for partitioning a chordal graph into transitive subgraphs
- \(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory
- Powers of distance-hereditary graphs
- A new class of perfect Hoàng graphs
- Directed Moore hypergraphs
- Cycle packings in graphs and digraphs
- Some properties of non-bicolorable hypergraphs and the four-color problem
- Bus interconnection networks
- A characterization of cube-hypergraphs
- Independent sets which meet all longest paths
- Open shop, satellite communication and a theorem by Egerváry (1931)
- Introduction to fuzzy hypergraphs and Hebbian structures
- A linear time algorithm for maximum matchings in convex, bipartite graphs
- Maximal intersection critical families of finite sets
- Kernels in graphs with a clique-cutset
- Intersecting fuzzy hypergraphs
- On a conjecture for the university timetabling problem
- Decomposing uniform hypergraphs into uniform hypertrees and single edges
- Thomassen's conjecture for line graphs of 3-hypergraphs
- Sparse hypergraphs: new bounds and constructions
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- Hypergraphs induced by algebras of fixed type
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)
