Pages that link to "Item:Q1844861"

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

Displaying 50 items.

• Heuristics for the network design problem with connectivity requirements (Q281782) (← links)
• Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
• The complexity of subgraph isomorphism for classes of partial k-trees (Q671437) (← links)
• On the SPANNING \(k\)-TREE problem (Q686254) (← links)
• The specification of 2-trees (Q696853) (← links)
• Separating subgraphs in k-trees: Cables and caterpillars (Q795842) (← links)
• On the structure of contractible edges in \(k\)-connected partial \(k\)-trees (Q844219) (← links)
• Approximation algorithms for treewidth (Q848843) (← links)
• Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph (Q907257) (← links)
• On the structure and deficiency of \(k\)-trees with bounded degree (Q908291) (← links)
• Isomorphism testing of k-trees is in NC, for fixed k (Q910212) (← links)
• On the complexity of some subgraph problems (Q967414) (← links)
• Bijective linear time coding and decoding for \(k\)-trees (Q970106) (← links)
• Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches (Q1024454) (← links)
• The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey (Q1062758) (← links)
• Characterization of partial 3-trees in terms of three structures (Q1086577) (← links)
• Some possible new directions for combinatorial matrix analysis (Q1109784) (← links)
• Canonical representations of partial 2- and 3-trees (Q1196453) (← links)
• A characterization of \(k\)-trees (Q1198515) (← links)
• A coding algorithm for Rényi trees (Q1207762) (← links)
• Linear algorithms on recursive representations of trees (Q1254104) (← links)
• A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
• A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges (Q1274933) (← links)
• The square of a chordal graph (Q1322181) (← links)
• The nonexistence of reduction rules giving an embedding into a \(k\)-tree (Q1336627) (← links)
• \(k\)-NLC graphs and polynomial algorithms (Q1336631) (← links)
• On the extension of a partial metric to a tree metric (Q1422428) (← links)
• A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs (Q1731506) (← links)
• Complexity of some graph-based bounds on the probability of a union of events (Q1752603) (← links)
• Monotonicity and expansion of global secure sets (Q1761464) (← links)
• Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
• Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
• On \(k\)-tree containment graphs of paths in a tree (Q2035089) (← links)
• On zero-sum spanning trees and zero-sum connectivity (Q2073300) (← links)
• \(k\)-Wiener index of a \(k\)-plex (Q2075457) (← links)
• Nested locally Hamiltonian graphs and the Oberly-Sumner conjecture (Q2158203) (← links)
• New width parameters for SAT and \#SAT (Q2238644) (← links)
• Edge clique partition in \((k,\ell)\)-graphs (Q2243139) (← links)
• Improper sum-list colouring of 2-trees (Q2322872) (← links)
• Maximum matching width: new characterizations and a fast algorithm for dominating set (Q2413973) (← links)
• A note on the saturation number of the family of \(k\)-connected graphs (Q2439131) (← links)
• On the complexity of the black-and-white coloring problem on some classes of perfect graphs (Q2445872) (← links)
• An efficient representation of chordal graphs (Q2450661) (← links)
• Antimatroids and balanced pairs (Q2454046) (← links)
• Line graphs of bounded clique-width (Q2461201) (← links)
• Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
• Subclasses of \(k\)-trees: characterization and recognition (Q2489905) (← links)
• Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
• Requiring chords in cycles (Q2566156) (← links)