Pages that link to "Item:Q1118619"
From MaRDI portal
The following pages link to Recognizing claw-free perfect graphs (Q1118619):
Displaying 49 items.
- Forests and trees among Gallai graphs (Q472964) (← links)
- On the choosability of claw-free perfect graphs (Q503632) (← links)
- Some properties of graphs determined by edge zeta functions (Q624533) (← links)
- Which claw-free graphs are perfectly orderable? (Q686245) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Alternating orientation and alternating colouration of perfect graphs (Q1089007) (← links)
- Paw-free graphs (Q1108293) (← links)
- Gallai graphs and anti-Gallai graphs (Q1126196) (← links)
- Even pairs in claw-free perfect graphs (Q1127877) (← links)
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets (Q1197003) (← links)
- A description of claw-free perfect graphs (Q1306428) (← links)
- Mortality of iterated Gallai graphs (Q1321643) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- In praise of Claude Berge (Q1356723) (← links)
- Path parity and perfection (Q1356748) (← links)
- Choice number of 3-colorable elementary graphs (Q1356789) (← links)
- On a conjecture about uniquely colorable perfect graphs (Q1377674) (← links)
- On the choice number of claw-free perfect graphs (Q1422425) (← links)
- On the chromatic number of \(2 K_2\)-free graphs (Q1634757) (← links)
- Excluding hooks and their complements (Q1671647) (← links)
- A coloring algorithm for \(4 K_1\)-free line graphs (Q1686052) (← links)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- Minimal antichains in well-founded quasi-orders with an application to tournaments (Q1850501) (← links)
- On dart-free perfectly contractile graphs (Q1885896) (← links)
- On forbidden induced subgraphs for \(K_{1, 3}\)-free perfect graphs (Q1999727) (← links)
- On coloring a class of claw-free and hole-twin-free graphs (Q2091797) (← links)
- Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4 (Q2124634) (← links)
- On coloring a class of claw-free graphs. (Q2132368) (← links)
- On the structure of graphs without claw, \(4K_1\) and co-R (Q2158304) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- Perfect graphs with polynomially computable kernels (Q2283107) (← links)
- Finding induced paths of given parity in claw-free graphs (Q2428656) (← links)
- The \(k\)-in-a-path problem for claw-free graphs (Q2428671) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- A Berge-keeping operation for graphs (Q2433716) (← links)
- Which claw-free graphs are strongly perfect? (Q2433718) (← links)
- Finding a smallest odd hole in a claw-free graph using global structure (Q2444540) (← links)
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs (Q2576772) (← links)
- Complexity of clique-coloring odd-hole-free graphs (Q3652547) (← links)
- Intersection graphs of proper subtrees of unicyclic graphs (Q4309989) (← links)
- Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ (Q4982280) (← links)
- Counting Weighted Independent Sets beyond the Permanent (Q4997141) (← links)
- Total coloring of quasi-line graphs and inflated graphs (Q5025132) (← links)
- EULERIAN AND HAMILTONIAN PROPERTIES OF GALLAI AND ANTI-GALLAI TOTAL GRAPHS (Q5140108) (← links)
- The Structure of Claw‐Free Perfect Graphs (Q5417818) (← links)
- (Q5743476) (← links)
- Minimum weighted clique cover on claw‐free perfect graphs (Q6055392) (← links)
- Strongly perfect claw‐free graphs—A short proof (Q6080850) (← links)
- Divisibility and coloring of some \(P_5\)-free graphs (Q6124429) (← links)
