scientific article; zbMATH DE number 3889566
From MaRDI portal
Publication:3222876
Recommendations
Cited in
(48)- Algorithmic aspects of intersection graphs and representation hypergraphs
- On packing and covering numbers of graphs
- Hamiltonian powers in threshold and arborescent comparability graphs
- Matrix sandwich problems
- Geometric comparison of combinatorial polytopes
- LexBFS-orderings and powers of chordal graphs
- Recognizing interval digraphs and interval bigraphs in polynomial time
- Duchet-type theorems for powers of HHD-free graphs
- Independent domination in finitely defined classes of graphs
- Interpolation theorems for domination numbers of a graph
- On chordal graph and line graph squares
- Perfect elimination orderings of chordal powers of graphs
- Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality
- Negative results on characterizing visibility graphs
- Powers of distance-hereditary graphs
- Partitioning permutations into increasing and decreasing subsequences
- On powers of circular arc graphs and proper circular arc graphs
- Quasi-threshold graphs
- LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
- A type of algebraic structure related to sets of intervals
- Perfect elimination orderings for symmetric matrices
- Comparability graphs of lattices
- Combinatorial optimisation and hierarchical classifications
- Cycles and transitivity by monochromatic paths in arc-coloured digraphs
- scientific article; zbMATH DE number 3888924 (Why is no real title available?)
- On distance-3 matchings and induced matchings
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- On superperfect noncomparability graphs
- Simplicial Powers of Graphs
- Dually chordal graphs
- Treewidth versus clique number. II: Tree-independence number
- Vertex ranking of asteroidal triple-free graphs
- LexBFS-orderings and powers of graphs
- Transit functions and pyramid-like binary clustering systems
- On the cut-vertex and the interval transit functions of hypergraphs
- Tree-layout based graph classes: proper chordal graphs
- Convex geometries yielded by transit functions
- Transit functions and clustering systems
- On distance-3 matchings and induced matchings
- Tree decompositions meet induced matchings: beyond max weight independent set
- Tree decompositions meet induced matchings: beyond max weight independent set
- Graphs whose neighborhoods have no special cycles
- Circular representation problem on hypergraphs
- Clique graphs and Helly graphs
- Cut vertex transit functions of hypergraphs
- Novel evolutionary models and applications to sequence alignment problems
- \(\Gamma\)-cycles in arc-colored digraphs
- Intersection representations of matrices by subtrees and unicycles on graphs
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 Q3222876)
