The following pages link to Kristina Vušković (Q203962):
Displaying 19 items.
- A Class of Three‐Colorable Triangle‐Free Graphs (Q4916101) (← links)
- Counting Weighted Independent Sets beyond the Permanent (Q4997141) (← links)
- (Q5011877) (← links)
- A mickey-mouse decomposition theorem (Q5101425) (← links)
- A structure theorem for graphs with no cycle with a unique chord and its consequences (Q5189239) (← links)
- Triangle‐free graphs that do not contain an induced subdivision of <i>K</i><sub>4</sub> are 3‐colorable (Q5241606) (← links)
- Clique‐cutsets beyond chordal graphs (Q5379846) (← links)
- Odd Hole Recognition in Graphs of Bounded Clique Size (Q5470814) (← links)
- Perfect, ideal and balanced matrices (Q5943927) (← links)
- Recognition of quasi-Meyniel graphs (Q5951967) (← links)
- Coloring rings (Q6055414) (← links)
- Induced subgraphs and tree decompositions. II: Toward walls and their line graphs in graphs of bounded degree (Q6144405) (← links)
- Induced subgraphs and tree decompositions V. one neighbor in a hole (Q6199380) (← links)
- Graphs with all holes the same length (Q6380766) (← links)
- Submodular functions and perfect graphs (Q6504696) (← links)
- Tree independence number I. (Even hole, diamond, pyramid)-free graphs (Q6510289) (← links)
- Graphs with all holes the same length (Q6564607) (← links)
- Bisimplicial separators (Q6565812) (← links)
- Tree independence number. I. (Even hole, diamond, pyramid)-free graphs (Q6565817) (← links)