Pages that link to "Item:Q1406046"
From MaRDI portal
The following pages link to On variations of \(P_{4}\)-sparse graphs (Q1406046):
Displaying 19 items.
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (Q385962) (← links)
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355) (← links)
- On the minimum sum coloring of \(P_4\)-sparse graphs (Q742570) (← links)
- Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
- On quasi-monotonous graphs (Q897599) (← links)
- Classifying the clique-width of \(H\)-free bipartite graphs (Q906431) (← links)
- The stable set polytope for some extensions of \(P_4\)-free graphs (Q998505) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- Scattering number and modular decomposition (Q1356754) (← links)
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs (Q1414581) (← links)
- Independent sets in extensions of 2\(K_{2}\)-free graphs (Q1765375) (← links)
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs (Q1897361) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- Spiders and their kin: an investigation of Stanley's chromatic symmetric function for spiders and related graphs (Q2657070) (← links)
- Bounding Clique-Width via Perfect Graphs (Q2799217) (← links)
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
- Linear time solvable optimization problems on graphs of bounded clique width (Q4232773) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5965534) (← links)
