scientific article; zbMATH DE number 4103086

zbMATH Open0674.05021MaRDI QIDQ3828016FDOQ3828016

Authors: H. P. Patil 

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

• On a characterization of \(k\)-trees.
• scientific article
• Subclasses of \(k\)-trees: characterization and recognition
• A characterization of \(k\)-trees
• \(k\)-paths of \(k\)-trees

zbMATH Keywords

planar graphouterplanar graphstriangulated graphsk-tree

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (38)

• \(k\)-protected vertices in binary search trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the structure and deficiency of \(k\)-trees with bounded degree
• \(k\)-trees and some graph operators
• Characterizations of H-graphs
• A relationship between trees and Kelly–Mac Lane graphs
• Finding a Maximum-Weight Convex Set in a Chordal Graph
• Subclasses of \(k\)-trees: characterization and recognition
• Long paths and toughness of \(k\)-trees and chordal planar graphs
• On the book thickness of $k$-trees
• On simply structured bases of tree kernels
• Title not available (Why is that?)
• Title not available (Why is that?)
• A characterization of \(k\)-trees
• Equitable list tree-coloring of bounded treewidth graphs
• Learning Bounded Tree-Width Bayesian Networks via Sampling
• Efficient learning of Bayesian networks with bounded tree-width
• Title not available (Why is that?)
• Wiener indices of maximal \(k\)-degenerate graphs
• Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph
• 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
• Title not available (Why is that?)
• Approximate structure learning for large Bayesian networks
• Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets
• Structure of wheel-trees with colourings and domination numbers
• Convex dominating sets in maximal outerplanar graphs
• Sequences Characterizing k-Trees
• Separating subgraphs in k-trees: Cables and caterpillars
• On extremal sizes of locally \(k\)-tree graphs.
• A k-Tree Generalization that Characterizes Consistency of Dimensioned Engineering Drawings
• The pagenumber of \(k\)-trees is \(O(k)\)

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)