Pages that link to "Item:Q300476"
From MaRDI portal
The following pages link to A new characterization of \(P_k\)-free graphs (Q300476):
Displaying 16 items.
- Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
- Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
- Binomial edge ideals of regularity 3 (Q1794063) (← links)
- On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs (Q2087455) (← links)
- A proof of a conjecture on the connected domination number (Q2091175) (← links)
- Vertex cover at distance on \(H\)-free graphs (Q2115860) (← links)
- The maximum size of an edge 2-neighborhood in \(P_5\)-free graphs (Q2144507) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- (Q5075768) (← links)
- Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs (Q5216779) (← links)
- Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6039437) (← links)
- Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658) (← links)
- Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)
- Level and pseudo-Gorenstein binomial edge ideals (Q6114008) (← links)