The following pages link to The strong perfect graph theorem (Q855256):
Displaying 50 items.
- Interview with Karim Adiprasito (Q6098019) (← links)
- Complement of the reduced non-zero component graph of free semimodules (Q6100874) (← links)
- On chromatic number and perfectness of fuzzy graph (Q6118905) (← links)
- Ramsey numbers and graph parameters (Q6121914) (← links)
- Infinite families of \(k\)-vertex-critical \((P_5, C_5)\)-free graphs (Q6121915) (← links)
- Divisibility and coloring of some \(P_5\)-free graphs (Q6124429) (← links)
- On CD-chromatic number and its lower bound in some classes of graphs (Q6124431) (← links)
- Star covers and star partitions of double-split graphs (Q6124494) (← links)
- On the chromatic number of (P5,dart)-free graphs (Q6132236) (← links)
- Coloring graphs with no induced five‐vertex path or gem (Q6134643) (← links)
- Coloring \(\{ P 2 \cup P 3 , \operatorname{house} \} \)-free graphs with \(\Delta - 1\) colors (Q6143841) (← links)
- Strengthening Brooks' chromatic bound on \(P_6\)-free graphs (Q6143873) (← links)
- Burling graphs revisited. II: Structure (Q6146492) (← links)
- (Q6155865) (← links)
- Critical (\(P_5\), bull)-free graphs (Q6157414) (← links)
- Some results on \(k\)-critical \(P_5\)-free graphs (Q6157421) (← links)
- Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs (Q6170792) (← links)
- Towards the Chen-Raspaud conjecture (Q6177406) (← links)
- Coloring (\(P_5\), kite)-free graphs with small cliques (Q6180573) (← links)
- Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs (Q6180578) (← links)
- Near optimal colourability on hereditary graph families (Q6196836) (← links)
- Graphs of large chromatic number (Q6198641) (← links)
- Well-quasi-ordering and Embeddability of Relational Structures (Q6493759) (← links)
- Total domination, separated-cluster, CD-coloring: algorithms and hardness (Q6547920) (← links)
- Induced subgraphs of bounded treewidth and the container method (Q6550989) (← links)
- Forbidden subgraphs in enhanced power graphs of finite groups (Q6552644) (← links)
- Homogeneous sets in graphs and a chromatic multisymmetric function (Q6564066) (← links)
- Graphs with all holes the same length (Q6564607) (← links)
- Graphs with girth 9 and without longer odd holes are 3-colourable (Q6565814) (← links)
- Perfect divisibility and coloring of some fork-free graphs (Q6570043) (← links)
- \( \chi \)-binding function for \((C_4, t\text{-broom}^+)\)-free graphs (Q6570047) (← links)
- Generalized non-coprime graphs of groups (Q6570588) (← links)
- Strong Erdős-Hajnal properties in chordal graphs (Q6574376) (← links)
- BE-diperfect digraphs with stability number two (Q6574382) (← links)
- Getting linear time in graphs of bounded neighborhood diversity (Q6599065) (← links)
- Exactly hittable interval graphs (Q6599815) (← links)
- The MaxIS-Shapley value in perfect graphs (Q6606181) (← links)
- Critical \((P_5,\mathit{dart})\)-free graphs (Q6606249) (← links)
- Some new results concerning power graphs and enhanced power graphs of groups (Q6611010) (← links)
- On the difference of the enhanced power graph and the power graph of a finite group (Q6612120) (← links)
- A simple \((2 + \epsilon)\)-approximation algorithm for split vertex deletion (Q6612520) (← links)
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number (Q6615757) (← links)
- Reconfiguration graph for vertex colourings of weakly chordal graphs (Q6621198) (← links)
- Total-rainbow connection and forbidden subgraphs (Q6633552) (← links)
- Linear <i>χ</i> -binding functions for some classes of ( <i>P</i> <sub>3</sub> ∪ <i>P</i> <sub>2</sub> )-free graphs (Q6643347) (← links)
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)
- Borodin-Kostochka's conjecture on \(\{P_2 \cup P_3, C_4\}\)-free graphs (Q6650716) (← links)
- On the unitary one matching bi-Cayley graph over finite rings (Q6650996) (← links)
- A study of upper ideal relation graphs of rings (Q6651155) (← links)
- Non-perfect \((P_5, C_5, K_5 -e)\)-free graphs are 5-colorable (Q6660054) (← links)
