scientific article; zbMATH DE number 3889566
From MaRDI portal
Publication:3222876
zbMATH Open0558.05038MaRDI QIDQ3222876FDOQ3222876
Authors: Pierre Duchet
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
interval graphsperfect graphscomparability graphstriangulated graphsinterval hypergraphsclassical perfect graphsrepresentative graphssubtree hypergraphs
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Paths and cycles (05C38) Connectivity (05C40) Hypergraphs (05C65)
Cited In (43)
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Comparability graphs of lattices
- Cut vertex transit functions of hypergraphs
- Treewidth versus clique number. II: Tree-independence number
- Combinatorial optimisation and hierarchical classifications
- Negative results on characterizing visibility graphs
- Matrix sandwich problems
- Recognizing interval digraphs and interval bigraphs in polynomial time
- Title not available (Why is that?)
- LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
- Novel evolutionary models and applications to sequence alignment problems
- On powers of circular arc graphs and proper circular arc graphs
- Vertex ranking of asteroidal triple-free graphs
- Partitioning permutations into increasing and decreasing subsequences
- Perfect elimination orderings for symmetric matrices
- Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality
- Transit functions and pyramid-like binary clustering systems
- Clique graphs and Helly graphs
- Hamiltonian powers in threshold and arborescent comparability graphs
- Dually chordal graphs
- Independent domination in finitely defined classes of graphs
- Cycles and transitivity by monochromatic paths in arc-coloured digraphs
- On superperfect noncomparability graphs
- On distance-3 matchings and induced matchings
- Quasi-threshold graphs
- On chordal graph and line graph squares
- Simplicial Powers of Graphs
- \(\Gamma\)-cycles in arc-colored digraphs
- Geometric comparison of combinatorial polytopes
- On distance-3 matchings and induced matchings
- LexBFS-orderings and powers of chordal graphs
- Duchet-type theorems for powers of HHD-free graphs
- Algorithmic aspects of intersection graphs and representation hypergraphs
- On packing and covering numbers of graphs
- Powers of distance-hereditary graphs
- On the cut-vertex and the interval transit functions of hypergraphs
- Perfect elimination orderings of chordal powers of graphs
- Intersection representations of matrices by subtrees and unicycles on graphs
- A type of algebraic structure related to sets of intervals
- LexBFS-orderings and powers of graphs
- Interpolation theorems for domination numbers of a graph
- Graphs whose neighborhoods have no special cycles
- Circular representation problem on 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 Q3222876)