scientific article; zbMATH DE number 1944138
From MaRDI portal
Publication:4407446
Recommendations
Cited in
(19)- Colouring Some Classes of Perfect Graphs Robustly
- Perfect graphs are kernel solvable
- The structure of bull-free graphs I -- three-edge-paths with centers and anticenters
- Optimality of DSatur algorithm on chordal graphs
- On word colourings and some perfect graphs
- A note on perfectly orderable graphs
- Defective Coloring on Classes of Perfect Graphs
- The independent set perturbation method for efficient computation of sensitivities with applications to data assimilation and a finite element shallow water model
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs
- Perfect precise colourings of \(\{3,n\}\) with \(n\) colours
- Perfect 2-colorings of the generalized Petersen graph
- Perfect colorings of the prism graph
- scientific article; zbMATH DE number 1033812 (Why is no real title available?)
- Coloring planar perfect graphs by decomposition
- Reconfiguration of colorable sets in classes of perfect graphs
- scientific article; zbMATH DE number 863472 (Why is no real title available?)
- Reconfiguration of Colorable Sets in Classes of Perfect Graphs
- A constant factor approximation algorithm for boxicity of circular arc graphs
- Perfect 3-colorings on 6-regular graphs of order 9
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4407446)
