Recognizing claw-free perfect graphs
From MaRDI portal
Publication:1118619
Recommendations
Cites work
- scientific article; zbMATH DE number 3889583 (Why is no real title available?)
- scientific article; zbMATH DE number 3908479 (Why is no real title available?)
- Algorithms on clique separable graphs
- An algorithm for finding clique cut-sets
- Decomposition of regular matroids
- On rigid circuit graphs
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- Transitiv orientierbare Graphen
- Weakly triangulated graphs
Cited in
(53)- Divisibility and coloring of some \(P_5\)-free graphs
- On coloring a class of claw-free graphs.
- Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4
- On forbidden induced subgraphs for \(K_{1, 3}\)-free perfect graphs
- On some graph classes related to perfect graphs: a survey
- A description of claw-free perfect graphs
- Forests and trees among Gallai graphs
- On a conjecture about uniquely colorable perfect graphs
- Declawing a graph: polyhedra and branch-and-cut algorithms
- Gallai graphs and anti-Gallai graphs
- A Berge-keeping operation for graphs
- On the chromatic number of \(2 K_2\)-free graphs
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- Finding a smallest odd hole in a claw-free graph using global structure
- Finding induced paths of given parity in claw-free graphs
- Claw-free graphs---a survey
- Some properties of graphs determined by edge zeta functions
- Recognizing Dart-Free Perfect Graphs
- Claw-free graphs, skeletal graphs, and a stronger conjecture on \(\omega\), \(\Delta\), and \(\chi\)
- Counting weighted independent sets beyond the permanent
- Mortality of iterated Gallai graphs
- Intersection graphs of proper subtrees of unicyclic graphs
- Paw-free graphs
- In praise of Claude Berge
- The \(k\)-in-a-path problem for claw-free graphs
- Minimum weighted clique cover on claw‐free perfect graphs
- Recognizing bull-free perfect graphs
- scientific article; zbMATH DE number 140465 (Why is no real title available?)
- Even pairs in claw-free perfect graphs
- Which claw-free graphs are perfectly orderable?
- EULERIAN AND HAMILTONIAN PROPERTIES OF GALLAI AND ANTI-GALLAI TOTAL GRAPHS
- On the structure of graphs without claw, \(4K_1\) and co-R
- On dart-free perfectly contractile graphs
- Excluding hooks and their complements
- Alternating orientation and alternating colouration of perfect graphs
- On the choosability of claw-free perfect graphs
- Which claw-free graphs are strongly perfect?
- Choice number of 3-colorable elementary graphs
- A faster algorithm to recognize even-hole-free graphs
- Total coloring of quasi-line graphs and inflated graphs
- Strongly perfect claw‐free graphs—A short proof
- A coloring algorithm for \(4 K_1\)-free line graphs
- On the choice number of claw-free perfect graphs
- Complexity of clique-coloring odd-hole-free graphs
- Classes of perfect graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- The structure of claw-free perfect graphs
- Minimal antichains in well-founded quasi-orders with an application to tournaments
- Perfect graphs with polynomially computable kernels
- Path parity and perfection
- On coloring a class of claw-free and hole-twin-free graphs
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
This page was built for publication: Recognizing claw-free perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1118619)
