The following pages link to Bernard Ries (Q266809):
Displayed 50 items.
- On the minimum and maximum selective graph coloring problems in some graph classes (Q266810) (← links)
- On the ratio between maximum weight perfect matchings and maximum weight matchings in grids (Q290099) (← links)
- Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs (Q411837) (← links)
- Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures (Q411838) (← links)
- A note on chromatic properties of threshold graphs (Q418900) (← links)
- Coloring graphs characterized by a forbidden subgraph (Q476308) (← links)
- (Q489342) (redirect page) (← links)
- Blockers for the stability number and the chromatic number (Q489343) (← links)
- A 2-approximation for the maximum satisfying bisection problem (Q531427) (← links)
- Upper domination: towards a dichotomy through boundary properties (Q722525) (← links)
- Characterizations of cographs as intersection graphs of paths on a grid (Q741533) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- CPG graphs: some structural and hardness results (Q827595) (← links)
- Addendum to ``Bicolored matchings in some classes of graphs'' (Q937244) (← links)
- Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
- Mixed graph edge coloring (Q1043571) (← links)
- Blockers and transversals (Q1043948) (← links)
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid (Q1045154) (← links)
- Characterising chordal contact \(B_0\)-VPG graphs (Q1661864) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- On contact graphs of paths on a grid (Q1725765) (← links)
- Critical vertices and edges in \(H\)-free graphs (Q1730263) (← links)
- Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
- Perfectness of clustered graphs (Q1799385) (← links)
- The firefighter problem with more than one firefighter on trees (Q1949095) (← links)
- On the maximum independent set problem in subclasses of subcubic graphs (Q2018543) (← links)
- Blocking total dominating sets via edge contractions (Q2034793) (← links)
- On some special classes of contact \(B_0\)-VPG graphs (Q2064288) (← links)
- On some subclasses of split \(B_1\)-EPG graphs (Q2081659) (← links)
- On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs (Q2087455) (← links)
- Using edge contractions to reduce the semitotal domination number (Q2098176) (← links)
- Reducing the domination number of graphs via edge contractions and vertex deletions (Q2219962) (← links)
- Reducing the domination number of \(( P_3 + k P_2 )\)-free graphs via one edge contraction (Q2235275) (← links)
- Packing and covering with linear programming: a survey (Q2253646) (← links)
- Maximum eccentric connectivity index for graphs with given diameter (Q2274082) (← links)
- On split \(B_1\)-EPG graphs (Q2294698) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- Detecting strong cliques (Q2312812) (← links)
- On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs (Q2376078) (← links)
- \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs (Q2376794) (← links)
- Reducing the chromatic number by vertex or edge deletions (Q2413179) (← links)
- Proper circular arc graphs as intersection graphs of paths on a grid (Q2416437) (← links)
- On two coloring problems in mixed graphs (Q2426450) (← links)
- On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167) (← links)
- On some applications of the selective graph coloring problem (Q2629634) (← links)
- Optimal edge-coloring with edge rate constraints (Q2811307) (← links)
- A Boundary Property for Upper Domination (Q2819507) (← links)
- Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions (Q2835660) (← links)
- Some properties of edge intersection graphs of single bend paths on a grid (Q2851434) (← links)