Pages that link to "Item:Q1844861"

The following pages link to On simple characterizations of k-trees (Q1844861):

Displaying 36 items.

• On \(\alpha\)-excellent graphs (Q2683166) (← links)
• (Q2741352) (← links)
• The triangles method to build<i>X</i>-trees from incomplete distance matrices (Q2773174) (← links)
• A PTAS for the Cluster Editing Problem on Planar Graphs (Q2971154) (← links)
• Parameters Tied to Treewidth (Q2978180) (← links)
• One-phase algorithm for the determination of minimal vertex separators of chordal graphs (Q3002552) (← links)
• Extremal graphs having no matching cuts (Q3113291) (← links)
• Approximation of the Quadratic Knapsack Problem (Q3186661) (← links)
• Steiner trees, partial 2–trees, and minimum IFI networks (Q3311677) (← links)
• A Separator Theorem for Chordal Graphs (Q3344230) (← links)
• A Cryptographic Code Based on Digraphs (Q3438995) (← links)
• The Reduced Prüfer Code for Rooted Labelled k-Trees (Q3439323) (← links)
• Edge-maximal graphs of branchwidth k (Q3439366) (← links)
• Community Structure Inspired Algorithms for SAT and #SAT (Q3453228) (← links)
• A characterization of partial 3-trees (Q3479834) (← links)
• The Clique-Width of Tree-Power and Leaf-Power Graphs (Q3508556) (← links)
• Monadic Second Order Logic on Graphs with Local Cardinality Constraints (Q3599161) (← links)
• The most reliable series-parallel networks (Q3713842) (← links)
• Characterization and Recognition of Partial 3-Trees (Q3728922) (← links)
• Complexity of Finding Embeddings in a <i>k</i>-Tree (Q3751595) (← links)
• Networks immune to isolated failures (Q3910454) (← links)
• Isomorphism Testing in Hookup Classes (Q3968949) (← links)
• Drawing Planar Graphs with Few Geometric Primitives (Q4585062) (← links)
• A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths (Q4645295) (← links)
• Extremal interval graphs (Q4693349) (← links)
• On the chordality of a graph (Q4693359) (← links)
• (Q4915354) (← links)
• Sequential and parallel algorithms for embedding problems on classes of partial k-trees (Q5054759) (← links)
• Two strikes against perfect phylogeny (Q5204323) (← links)
• A CHARACTERIZATION OF k-TH POWERS P_n,k OF PATHS IN TERMS OF k-TREES (Q5249270) (← links)
• Shape Measures of Random Increasing <i>k</i>-trees (Q5366914) (← links)
• Chromatic index, treewidth and maximum degree (Q5916063) (← links)
• Using a hybrid of exact and genetic algorithms to design survivable networks (Q5955471) (← links)
• A new characterization of \(k\)-trees and some applications (Q6552676) (← links)
• Interval colourable orientations of graphs (Q6589119) (← links)
• Graphs whose vertices of degree at least 2 lie in a triangle (Q6667338) (← links)