Pages that link to "Item:Q1962062"
From MaRDI portal
The following pages link to Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs (Q1962062):
Displaying 9 items.
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432) (← links)
- \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs (Q436601) (← links)
- Computing a minimum paired-dominating set in strongly orderable graphs (Q1634760) (← links)
- Finding a sun in building-free graphs (Q1926049) (← links)
- Perfect circular arc coloring (Q2569164) (← links)
- Edge erasures and chordal graphs (Q5061692) (← links)
- The Perfect Matching Reconfiguration Problem (Q5092444) (← links)
- Strong Chordality of Graphs with Possible Loops (Q5854465) (← links)
- Coloring squares of graphs via vertex orderings (Q5859506) (← links)
