The following pages link to Kristina Vušković (Q203962):
Displaying 50 items.
- Coloring perfect graphs with no balanced skew-partitions (Q490982) (← links)
- A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799) (← links)
- On Roussel-Rubio-type lemmas and their consequences (Q533774) (← links)
- Perfect graphs, partitionable graphs and cutsets (Q700371) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- Triangulated neighborhoods in even-hole-free graphs (Q870966) (← links)
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences (Q1026014) (← links)
- Balanced cycles and holes in bipartite graphs (Q1297428) (← links)
- (Q1375056) (redirect page) (← links)
- Universally signable graphs (Q1375057) (← links)
- Square-free perfect graphs. (Q1426100) (← links)
- A class of \(\beta\)-perfect graphs (Q1567275) (← links)
- The graph sandwich problem for 1-join composition is NP-complete (Q1613390) (← links)
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- Coloring square-free Berge graphs (Q1719576) (← links)
- Decomposition of odd-hole-free graphs by double star cutsets and 2-joins (Q1827853) (← links)
- Balanced \(0,\pm 1\) matrices. I: Decomposition (Q1850525) (← links)
- Balanced \(0,\pm 1\) matrices. II: Recognition algorithm (Q1850526) (← links)
- Decomposition of even-hole-free graphs with star cutsets and 2-joins (Q1932477) (← links)
- Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes (Q2032702) (← links)
- Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree (Q2171016) (← links)
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs (Q2173431) (← links)
- The (theta, wheel)-free graphs. II: Structure theorem (Q2173432) (← links)
- The (theta, wheel)-free graphs. III: Cliques, stable sets and coloring (Q2173433) (← links)
- The (theta, wheel)-free graphs. IV: Induced paths and cycles (Q2221936) (← links)
- Chromatic index of graphs with no cycle with a unique chord (Q2267844) (← links)
- Detecting 2-joins faster (Q2376790) (← links)
- Clique cutsets beyond chordal graphs (Q2413155) (← links)
- Balanced matrices (Q2433704) (← links)
- Recognizing Berge graphs (Q2494439) (← links)
- Vertex elimination orderings for hereditary graph classes (Q2514166) (← links)
- Perfect matchings in balanced hypergraphs (Q2563509) (← links)
- Graphs with polynomially many minimal separators (Q2664556) (← links)
- Even-hole-free graphs part I: Decomposition theorem (Q2778281) (← links)
- (Q2816076) (← links)
- Linear Balanceable and Subcubic Balanceable Graphs* (Q2874096) (← links)
- The world of hereditary graph classes viewed through Truemper configurations (Q2875860) (← links)
- A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs (Q2945208) (← links)
- On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph (Q2978173) (← links)
- Even-hole-free graphs part II: Recognition algorithm (Q3150171) (← links)
- Algorithms for 3PC(⋅, ⋅)-free Berge graphs (Q3439311) (← links)
- Algorithms for Square-3PC($\cdot, \cdot$)-Free Berge Graphs (Q3614194) (← links)
- Even and odd holes in cap-free graphs (Q4238043) (← links)
- (Q4335200) (← links)
- (Q4398363) (← links)
- (Q4500707) (← links)
- On rank-width of even-hole-free graphs (Q4558968) (← links)
- The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs (Q4632025) (← links)
- Even-hole-free graphs: A survey (Q4899861) (← links)
- Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It (Q4915184) (← links)
