Pages that link to "Item:Q972332"

The following pages link to A new characterization of \(P_{6}\)-free graphs (Q972332):

Displaying 17 items.

• A new characterization of \(P_k\)-free graphs (Q300476) (← links)
• The price of connectivity for dominating set: upper bounds and complexity (Q406321) (← links)
• On partitioning a graph into two connected subgraphs (Q650911) (← links)
• Prime graphs, matchings and the Castelnuovo-Mumford regularity (Q670634) (← links)
• Partitioning graphs into connected parts (Q1034603) (← links)
• Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
• On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs (Q2087455) (← links)
• The maximum size of an edge 2-neighborhood in \(P_5\)-free graphs (Q2144507) (← links)
• Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs (Q2222949) (← links)
• A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs (Q2403797) (← links)
• 4-coloring \((P_6, \text{bull})\)-free graphs (Q2403807) (← links)
• The signature of chordal graphs and cographs (Q2657112) (← links)
• Partitioning Graphs into Connected Parts (Q3392949) (← links)
• Laplacian integral graphs with a given degree sequence constraint (Q5065211) (← links)
• On indicated coloring of some classes of graphs (Q5919702) (← links)
• Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)
• Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)