scientific article; zbMATH DE number 4103086
From MaRDI portal
Publication:3828016
Recommendations
Cited in
(43)- A k-Tree Generalization that Characterizes Consistency of Dimensioned Engineering Drawings
- k-protected vertices in binary search trees
- The pagenumber of \(k\)-trees is \(O(k)\)
- On the structure and deficiency of k-trees with bounded degree
- scientific article; zbMATH DE number 4132187 (Why is no real title available?)
- scientific article; zbMATH DE number 3841909 (Why is no real title available?)
- A new characterization of \(k\)-trees and some applications
- \(k\)-trees and some graph operators
- A relationship between trees and Kelly–Mac Lane graphs
- Long paths and toughness of \(k\)-trees and chordal planar graphs
- Learning bounded tree-width Bayesian networks via sampling
- Subclasses of \(k\)-trees: characterization and recognition
- On simply structured bases of tree kernels
- On the book thickness of k-trees
- Characterization of \(k\)-ctrees and graph valued functions
- scientific article; zbMATH DE number 5551578 (Why is no real title available?)
- A characterization of \(k\)-trees
- Equitable list tree-coloring of bounded treewidth graphs
- How to count \(k\)-paths
- Efficient learning of Bayesian networks with bounded tree-width
- k-paths of k-trees
- On a characterization of \(k\)-trees.
- Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph
- Wiener indices of maximal \(k\)-degenerate graphs
- scientific article; zbMATH DE number 3843798 (Why is no real title available?)
- Some properties of \(k\)-trees
- Edge-intersection graphs of grid paths: the bend-number
- The square of a chordal graph
- Models of adding relations to an organization structure of a complete K-ary tree
- On zero-sum spanning trees and zero-sum connectivity
- \(k\)-Wiener index of a \(k\)-plex
- Enumeration of K-trees and applications
- \((k+1)\)-line graphs of \(k\)-trees
- scientific article; zbMATH DE number 3957132 (Why is no real title available?)
- Approximate structure learning for large Bayesian networks
- Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets
- Finding a maximum-weight convex set in a chordal graph
- Characterizations of \(H\)-graphs
- Structure of wheel-trees with colourings and domination numbers
- Convex dominating sets in maximal outerplanar graphs
- Separating subgraphs in k-trees: Cables and caterpillars
- Sequences Characterizing k-Trees
- On extremal sizes of locally \(k\)-tree 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 Q3828016)
