Pages that link to "Item:Q4845852"

The following pages link to Treewidth of Chordal Bipartite Graphs (Q4845852):

Displaying 15 items.

• Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
• On factorial properties of chordal bipartite graphs (Q442348) (← links)
• \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
• Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
• Partially ordered knapsack and applications to scheduling (Q881568) (← links)
• Connected graph searching in chordal graphs (Q967304) (← links)
• Treewidth for graphs with small chordality (Q1372729) (← links)
• Chordal embeddings of planar graphs (Q1417569) (← links)
• Listing all potential maximal cliques of a graph (Q1605302) (← links)
• Chordal bipartite graphs of bounded tree- and clique-width (Q1827785) (← links)
• A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
• On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
• Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
• A revisit of the scheme for computing treewidth and minimum fill-in (Q2441783) (← links)
• On 3-degree 4-chordal graphs (Q6174132) (← links)