The following pages link to Martin Milanič (Q266922):
Displaying 50 items.
- Strong cliques and equistability of EPT graphs (Q260014) (← links)
- On the readability of overlap digraphs (Q266924) (← links)
- Equistarable bipartite graphs (Q279223) (← links)
- On equistable, split, CIS, and related classes of graphs (Q344829) (← links)
- On CIS circulants (Q394314) (← links)
- A characterization of line graphs that are squares of graphs (Q400504) (← links)
- Set graphs. IV. Further connections with claw-freeness (Q400530) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- Complexity of independent set reconfigurability problems (Q441866) (← links)
- Vertex-transitive CIS graphs (Q472401) (← links)
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs (Q477326) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- On a class of graphs between threshold and total domishold graphs (Q496435) (← links)
- 1-perfectly orientable \(K_{4}\)-minor-free and outerplanar graphs (Q510581) (← links)
- On three extensions of equimatchable graphs (Q510986) (← links)
- \(1\)-perfectly orientable graphs and graph products (Q526271) (← links)
- Competitive evaluation of threshold functions in the priced information model (Q646704) (← links)
- Complexity results for equistable graphs and related classes (Q646721) (← links)
- Shortest paths between shortest paths (Q719258) (← links)
- The price of connectivity for cycle transversals (Q739064) (← links)
- Dominating sequences in graphs (Q740654) (← links)
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- Mind the independence gap (Q776261) (← links)
- Structural identifiability in low-rank matrix factorization (Q848955) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- On finding augmenting graphs (Q955317) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- A dichotomy for weighted efficient dominating sets with bounded degree vertices (Q1628682) (← links)
- On total domination in the Cartesian product of graphs (Q1656910) (← links)
- Improved algorithms for \(k\)-domination and total \(k\)-domination in proper interval graphs (Q1661898) (← links)
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- Maximizing the number of independent sets of fixed size in connected graphs with given independence number (Q1684927) (← links)
- The minimum conflict-free row split problem revisited (Q1687927) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs (Q1709574) (← links)
- On two extensions of equimatchable graphs (Q1751251) (← links)
- A three-person deterministic graphical game without Nash equilibria (Q1752440) (← links)
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
- Resilience and optimization of identifiable bipartite graphs (Q1941385) (← links)
- Set graphs. I. Hereditarily finite sets and extensional acyclic orientations (Q1941395) (← links)
- On the approximability and exact algorithms for vector domination and related problems in graphs (Q1946216) (← links)
- Critical properties of graphs of bounded clique-width (Q1947013) (← links)
- Dilation coefficient, plane-width, and resolution coefficient of graphs (Q1950340) (← links)
- Searching for square-complementary graphs: complexity of recognition and further nonexistence results (Q2022157) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- Treewidth versus clique number in graph classes with a forbidden structure (Q2110610) (← links)
- Edge elimination and weighted graph classes (Q2110614) (← links)
- Vertex cover at distance on \(H\)-free graphs (Q2115860) (← links)
- A characterization of claw-free CIS graphs and new results on the order of CIS graphs (Q2132328) (← links)
