Pages that link to "Item:Q1764802"

The following pages link to On the structure of (\(P_{5}\),\,gem)-free graphs (Q1764802):

Displaying 29 items.

• Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
• Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
• Dominating induced matchings for \(P_7\)-free graphs in linear time (Q476446) (← links)
• Well-quasi-ordering versus clique-width: new results on bigenic classes (Q722586) (← links)
• On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
• New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
• Algorithmic aspects of switch cographs (Q906430) (← links)
• Classifying the clique-width of \(H\)-free bipartite graphs (Q906431) (← links)
• Solving some NP-complete problems using split decomposition (Q948695) (← links)
• Structure and stability number of chair-, co-P- and gem-free graphs revisited (Q1007592) (← links)
• On the structure and stability number of \(P_{5}\)- and co-chair-free graphs (Q1414581) (← links)
• (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. (Q1428548) (← links)
• Towards an isomorphism dichotomy for hereditary graph classes (Q1693994) (← links)
• Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
• Bounding clique-width via perfect graphs (Q2424685) (← links)
• 2-clique-bond of stable set polyhedra (Q2446841) (← links)
• Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs (Q2461195) (← links)
• List coloring in the absence of two subgraphs (Q2636800) (← links)
• Bounding Clique-Width via Perfect Graphs (Q2799217) (← links)
• Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes (Q2819509) (← links)
• Bounding the Clique-Width of H-free Chordal Graphs (Q2946383) (← links)
• Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
• A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS (Q5232874) (← links)
• (Q5705706) (← links)
• Fundamentals of Computation Theory (Q5900786) (← links)
• Bounding the clique-width of \(H\)-free split graphs (Q5965534) (← links)
• A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs (Q6039897) (← links)
• Coloring graphs with no induced five‐vertex path or gem (Q6134643) (← links)