The following pages link to Vadim V. Lozin (Q317397):
Displaying 50 items.
- (Q170458) (redirect page) (← links)
- Efficient domination through eigenvalues (Q317399) (← links)
- New results on word-representable graphs (Q344843) (← links)
- Vertex coloring of graphs with few obstructions (Q344868) (← links)
- Boundary properties of well-quasi-ordered sets of graphs (Q382896) (← links)
- Corrigendum to ``Locally bounded coverings and factorial properties of graphs'' (Q402475) (← links)
- A decidability result for the dominating set problem (Q410736) (← links)
- Locally bounded coverings and factorial properties of graphs (Q412246) (← links)
- On factorial properties of chordal bipartite graphs (Q442348) (← links)
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
- Implicit representations and factorial properties of graphs (Q472962) (← links)
- Boundary properties of graphs for algorithmic graph problems (Q551178) (← links)
- (Q592314) (redirect page) (← links)
- (Q592894) (redirect page) (← links)
- A note on the speed of hereditary graph properties (Q640407) (← links)
- Stability preserving transformations of graphs (Q646718) (← links)
- Canonical antichains of unit interval and bipartite permutation graphs (Q651422) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
- On hereditary properties of the class of graphs with convex quadratic stability number (Q690543) (← links)
- Augmenting graphs for independent sets (Q705491) (← links)
- On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179) (← links)
- Upper domination: towards a dichotomy through boundary properties (Q722525) (← links)
- Well-quasi-ordering versus clique-width: new results on bigenic classes (Q722586) (← links)
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- The micro-world of cographs (Q831855) (← links)
- Gearing optimization (Q833443) (← links)
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (Q848637) (← links)
- On independent vertex sets in subclasses of apple-free graphs (Q848838) (← links)
- Polar graphs and maximal independent sets (Q860455) (← links)
- Labelled induced subgraphs and well-quasi-ordering (Q890007) (← links)
- Bichain graphs: geometric model and universal graphs (Q896651) (← links)
- Words and graphs (Q897110) (← links)
- On finding augmenting graphs (Q955317) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs (Q976106) (← links)
- Finding augmenting chains in extensions of claw-free graphs (Q1007635) (← links)
- Some results on graphs without long induced paths (Q1029004) (← links)
- Independent domination in finitely defined classes of graphs (Q1399990) (← links)
- Robust algorithms for the stable set problem (Q1411110) (← links)
- An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs (Q1414237) (← links)
- Foreword: Special issue on stability in graphs and related topics (Q1414577) (← links)
- Struction revisited (Q1414580) (← links)
- Stable sets in two subclasses of banner-free graphs (Q1414588) (← links)
- Conic reduction of graphs for the stable set problem (Q1579563) (← links)
- Stability in \(P_5\)- and banner-free graphs (Q1580977) (← links)
- Perfect edge domination: hard and solvable cases (Q1639290) (← links)
- Graph parameters and Ramsey theory (Q1642694) (← links)
- Linear clique-width of bi-complement reducible graphs (Q1670978) (← links)
