Pages that link to "Item:Q412260"
From MaRDI portal
The following pages link to Classes of graphs with small rank decompositions are \(\chi \)-bounded (Q412260):
Displaying 12 items.
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (Q505914) (← links)
- The grid theorem for vertex-minors (Q2099410) (← links)
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
- Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded (Q2284734) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- VC-dimension and Erdős-Pósa property (Q2515568) (← links)
- The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor (Q2662350) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Amalgams and χ-Boundedness (Q2958199) (← links)
- Circle graphs are quadratically χ‐bounded (Q5006380) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Vertex-minors of graphs: a survey (Q6495258) (← links)
