Pages that link to "Item:Q2489905"

The following pages link to Subclasses of \(k\)-trees: characterization and recognition (Q2489905):

Displaying 23 items.

• Generating and counting unlabeled \(k\)-path graphs (Q496683) (← links)
• Separating subgraphs in k-trees: Cables and caterpillars (Q795842) (← links)
• On the structure and deficiency of \(k\)-trees with bounded degree (Q908291) (← links)
• A clique-difference encoding scheme for labelled \(k\)-path graphs (Q1003468) (← links)
• Long paths and toughness of \(k\)-trees and chordal planar graphs (Q1618219) (← links)
• A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs (Q1731506) (← links)
• \(k\)-paths of \(k\)-trees (Q2089555) (← links)
• An improved planar graph product structure theorem (Q2152790) (← links)
• Nested locally Hamiltonian graphs and the Oberly-Sumner conjecture (Q2158203) (← links)
• On \((k+1)\)-line graphs of \(k\)-trees and their nullities (Q2229485) (← links)
• Non-inclusion and other subclasses of chordal graphs (Q2283105) (← links)
• On the Wiener index, distance cospectrality and transmission-regular graphs (Q2399284) (← links)
• On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees (Q2692183) (← links)
• Characterizations of H-graphs (Q2795961) (← links)
• \(k\)-separator chordal graphs: leafage and subfamilies (Q2862158) (← links)
• One-phase algorithm for the determination of minimal vertex separators of chordal graphs (Q3002552) (← links)
• (Q3312271) (← links)
• On the characteristic polynomial of the power of a path. (Q4691305) (← links)
• How to count \(k\)-paths (Q5094088) (← links)
• MAXIMAL OUTERPLANE GRAPHS WITH TWO SIMPLICIAL VERTICES (Q5150704) (← links)
• Extremal problems for connected set enumeration (Q6094711) (← links)
• Interval colourable orientations of graphs (Q6589119) (← links)
• Graphs whose vertices of degree at least 2 lie in a triangle (Q6667338) (← links)