Pages that link to "Item:Q1584312"

The following pages link to A characterization of strongly chordal graphs (Q1584312):

Displaying 21 items.

• A Dirac-type characterization of \(k\)-chordal graphs (Q394280) (← links)
• The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
• Boxicity of leaf powers (Q659669) (← links)
• A new characterization of strongly chordal graphs (Q1301851) (← links)
• On strongly chordal graphs that are not leaf powers (Q1687937) (← links)
• Strongly unichord-free graphs (Q1717190) (← links)
• Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs (Q1861263) (← links)
• Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs (Q1962062) (← links)
• Algorithms for generating strongly chordal graphs (Q2233439) (← links)
• Maxclique and unit disk characterizations of strongly chordal graphs (Q2509548) (← links)
• Strengthening strongly chordal graphs (Q2798313) (← links)
• The \(i\)-chords of cycles and paths (Q2866409) (← links)
• Symmetric graph-theoretic roles of two-pairs and chords of cycles (Q2920879) (← links)
• On the complexity of variations of mixed domination on graphs^† (Q2958268) (← links)
• (Q3808118) (← links)
• Characterizing strongly chordal graphs by using minimal relative separators (Q3974827) (← links)
• Characterizing k-chordal unichord-free graphs (Q4577849) (← links)
• Strong clique trees, neighborhood trees, and strongly chordal graphs (Q4948510) (← links)
• Odd twists on strongly chordal graphs (Q4968282) (← links)
• Dually and strongly chordal graphs (Q5058671) (← links)
• Strong Chordality of Graphs with Possible Loops (Q5854465) (← links)