The following pages link to \(\beta\)-perfect graphs (Q1924134):
Displaying 18 items.
- On realization graphs of degree sequences (Q284753) (← links)
- Vertex coloring of graphs with few obstructions (Q344868) (← links)
- More bounds for the Grundy number of graphs (Q511707) (← links)
- On the forbidden induced subgraph sandwich problem (Q643008) (← links)
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences (Q1026014) (← links)
- Linear recognition of pseudo-split graphs (Q1331889) (← links)
- Universally signable graphs (Q1375057) (← links)
- A class of \(\beta\)-perfect graphs (Q1567275) (← links)
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- On the structure of (even hole, kite)-free graphs (Q1756042) (← links)
- Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes (Q2032702) (← links)
- On lower bounds for the chromatic number in terms of vertex degree (Q2275368) (← links)
- Decremental optimization of vertex-coloring under the reconfiguration framework (Q2695300) (← links)
- Even-hole-free graphs part I: Decomposition theorem (Q2778281) (← links)
- Even-hole-free graphs part II: Recognition algorithm (Q3150171) (← links)
- (Q4500707) (← links)
- On the structure of (pan, even hole)‐free graphs (Q4604020) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
