The following pages link to (Q4737226):
Displaying 7 items.
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- 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)
- From a simple elimination ordering to a strong elimination ordering in linear time (Q1007631) (← links)
- Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs (Q2436666) (← links)
- The cyclic rank completion problem with general blocks (Q4965574) (← links)
- Graph classes and the switch Markov chain for matchings (Q5963358) (← links)