scientific article; zbMATH DE number 2170450
From MaRDI portal
Publication:4677945
zbMATH Open1075.05060MaRDI QIDQ4677945FDOQ4677945
Authors:
Publication date: 23 May 2005
Title of this publication is not available (Why is that?)
Recommendations
- On the recognition of \(k\)-equistable graphs
- Recognizing \(k\)-path graphs
- Recognizing \(k\)-equistable graphs in FPT time
- Helly EPT graphs on bounded degree trees: characterization and recognition
- Recognizing Knödel graphs
- On the recognition complexity of some graph properties
- Efficient recognition of equimatchable graphs
- Structure and recognition of domishold graphs
- On recognizing graphs by numbers of homomorphisms
- An algorithm for the recognition of domishold graphs
Cited In (8)
- Intersection models of weakly chordal graphs
- A superclass of edge-path-tree graphs with few cliques
- Integrality properties of edge path tree families
- Edge and vertex intersection of paths in a tree
- Triangulated edge intersection graphs of paths in a tree
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree
- Representing edge intersection graphs of paths on degree 4 trees
- The \(k\)-edge intersection graphs of paths in a tree
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 Q4677945)
