The following pages link to On semi-\(P_ 4\)-sparse graphs (Q1356751):
Displaying 16 items.
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- Augmenting graphs for independent sets (Q705491) (← links)
- On the minimum sum coloring of \(P_4\)-sparse graphs (Q742570) (← links)
- Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
- A tree representation for \(P_ 4\)-sparse graphs (Q1183332) (← links)
- Scattering number and modular decomposition (Q1356754) (← links)
- Independent domination in finitely defined classes of graphs (Q1399990) (← links)
- Stability in \(P_5\)- and banner-free graphs (Q1580977) (← links)
- Stability number in subclasses of \(P_5\)-free graphs (Q1764380) (← links)
- Independent sets in extensions of 2\(K_{2}\)-free graphs (Q1765375) (← links)
- On the stable set problem in special \(P_{5}\)-free graphs (Q1861559) (← links)
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs (Q1897361) (← links)
- Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
- Counting spanning trees using modular decomposition (Q2437761) (← links)
- Recognizing $P_4 $-Sparse Graphs in Linear Time (Q3990660) (← links)
