Pages that link to "Item:Q1428548"

The following pages link to (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. (Q1428548):

Displaying 17 items.

• Weighted independent sets in classes of \(P_6\)-free graphs (Q298979) (← links)
• On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (Q385962) (← links)
• Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
• Maximum weight independent sets in odd-hole-free graphs without dart or without bull (Q497314) (← links)
• On minimal prime extensions of a four-vertex graph in a prime graph (Q704276) (← links)
• New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
• On indicated coloring of graphs (Q897289) (← links)
• First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs (Q968185) (← links)
• Colouring of \((P_3 \cup P_2)\)-free graphs (Q1706425) (← links)
• Independent sets in extensions of 2\(K_{2}\)-free graphs (Q1765375) (← links)
• Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
• Two forbidden induced subgraphs and well-quasi-ordering (Q2275404) (← links)
• Sandwiches missing two ingredients of order four (Q2288872) (← links)
• Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes (Q2345603) (← links)
• Triangle packings and transversals of some \(K_{4}\)-free graphs (Q2413632) (← links)
• Counting spanning trees using modular decomposition (Q2437761) (← links)
• Bounding the Clique-Width of H-free Chordal Graphs (Q2946383) (← links)