scientific article; zbMATH DE number 3758364
From MaRDI portal
Publication:3941433
Cited in
(only showing first 100 items - show all)- The polytope of degree sequences
- Hypergraphs and a functional equation of Bouwkamp and de Bruijn
- Reducing hypergraph coloring to clique search
- Finding the \(K\) best policies in a finite-horizon Markov decision process
- On partial cubes, well-graded families and their duals with some applications in graphs
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
- A graph approximation heuristic for the vertex cover problem on planar graphs
- The chromatic index of a graph whose core has maximum degree two
- Perfectness of normal products of graphs
- A geometric approach to forbidden minors for GF(3)
- Interchange graphs and the Hamiltonian cycle polytope
- Networks beyond pairwise interactions: structure and dynamics
- Dynamic algorithms for classes of constraint satisfaction problems
- Some sequences associated with combinatorial structures
- Characterization and recognition of generalized clique-Helly graphs
- Dynamic maintenance of directed hypergraphs
- Edge deletion preserving the diameter of the hypercube
- Graphical properties related to minimal imperfection
- A note on bounds for the broadcast domination number of graphs
- Covering digraphs by paths
- Processor-time tradeoffs in PRAM simulations
- New classes of perfect graphs
- A counterexample to a generalization of Richardson's theorem
- Biregular subgraphs of biregular graphs
- Note sur la non existence d'un snark d'ordre 16
- Snarks of order 18
- Analyzing games by Boolean matrix iteration
- A parallel algorithm for eliminating cycles in undirected graphs
- Geometry, complexity, and combinatorics of permutation polytopes
- A logic-based analysis of Dempster-Shafer theory
- Distances in random plane-oriented recursive trees
- Eigenvector centrality in simplicial complexes of hypergraphs
- A note on total domination
- Pattern associativity and the retrieval of semantic networks
- A New Characterisation of Connected Hypergraphs
- Domination in Semigraphs
- On k-chromatically unique and k-chromatically equivalent hypergraphs
- Cycle structure of edge labelled graphs
- A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
- On a class of kernel-perfect and kernel-perfect-critical graphs
- On existence theorems
- Recent results on the total chromatic number
- A characterization of intersection graphs of the maximal rectangles of a polyomino
- Bounds relating generalized domination parameters
- Shannon-like games are difficult
- On graphic and 3-hypergraphic sequences
- On the Galois lattice of bipartite distance hereditary graphs
- On matroidal families
- A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
- Indecomposable regular graphs and hypergraphs
- Random partition models and complementary clustering of Anglo-Saxon place-names
- On pseudounimodular matrices
- Quasiorthogonal dimension of Euclidean spaces
- Spectra of cycle and path families of oriented hypergraphs
- Weakly coupled Gibbs measures
- Orienting graphs to optimize reachability
- Combinatorial verification of the elementary divisors of tensor products
- Uniquely solvable quadratic Boolean equations
- Circular mixed hypergraphs. II: The upper chromatic number
- A lower bound for the circumference of a graph
- Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
- Epidemiography. II: Games with a dozing yet winning player
- Irregularity strength of dense graphs
- Hypergraph models for the circuit layout problem
- An edge-coloration theorem for bipartite graphs with applications
- The length of a (0,1) matrix
- Large-scale problem analysis and decomposition theory
- Two-person games on graphs
- Interval hypergraphs and D-interval hypergraphs
- Locally restricted colorings
- Random hypergraphs and topological gelation criterion for crosslinked polymer systems
- The largest set partitioned by a subfamily of a cover
- Finding a homotopy base for directed paths in an acyclic graph
- On 2k-twisted graphs
- String graphs of k-bend paths on a grid
- Generalized s-distance colourings of a hypergraph
- On the existence of kernels and h-kernels in directed graphs
- Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations
- Greedy algorithms, H-colourings and a complexity-theoretic dichotomy.
- Construction of sports schedules with multiple venues
- Efficient recognition of equimatchable graphs
- On maximum \(k\)-edge-colorable subgraphs of bipartite graphs
- A degree condition for cycles of maximum length in bipartite digraphs
- A new property of the Lovász number and duality relations between graph parameters
- On the complexity of recognizing directed path families
- Ear decomposition for pair comparison data
- Strongly linear trend-free block designs and 1-factors of representative graphs
- Strong unimodularity for matrices and hypergraphs
- Distance-based (and path-based) covering problems for graphs of given cyclomatic number
- On 2-factors with \(k\) components
- The existence of uniquely \(-G\) colourable graphs
- On k-optimum dipath partitions and partial k-colourings of acyclic digraphs
- Partially dynamic maintenance of minimum weight hyperpaths
- A note on hypergraphs with the Helly-property
- Upper and lower bounds for graph-diameter problems with application to Record allocation
- Approximation of min coloring by moderately exponential algorithms
- Efficient approximation of Min Set Cover by moderately exponential algorithms
- Matroidal graphs
- Inequalities between the domination number and the chromatic number of a graph
- Connected hypergraphs without long Berge-paths
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 Q3941433)
