The following pages link to Martin Milanič (Q266922):
Displaying 48 items.
- Vector Connectivity in Graphs (Q4922139) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Fair Packing of Independent Sets (Q5041187) (← links)
- Strong cliques and stable sets (Q5058674) (← links)
- Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1‐Sperner hypergraphs (Q5066894) (← links)
- (Q5104255) (← links)
- Induced Embeddings into Hamming Graphs. (Q5111242) (← links)
- On the Recognition of k-Equistable Graphs (Q5200515) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)
- Partial Characterizations of 1‐Perfectly Orientable Graphs (Q5272923) (← links)
- Finding a Perfect Phylogeny from Mixed Tumor Samples (Q5283823) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- Latency-Bounded Target Set Selection in Social Networks (Q5326360) (← links)
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901120) (← links)
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)
- Bipartite graphs of small readability (Q5916257) (← links)
- Strong cliques in diamond-free graphs (Q5918595) (← links)
- Strong cliques in diamond-free graphs (Q5919069) (← links)
- Bipartite graphs of small readability (Q5919328) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Shifting paths to avoidable ones (Q6057583) (← links)
- Functionality of box intersection graphs (Q6140059) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Allocation of indivisible items with individual preference graphs (Q6157417) (← links)
- Computing well-covered vector spaces of graphs using modular decomposition (Q6184796) (← links)
- A characterization of claw-free CIS graphs and new results on the order of CIS graphs (Q6311112) (← links)
- Minimal separators in graph classes defined by small forbidden induced subgraphs (Q6315422) (← links)
- Avoidable Vertices and Edges in Graphs (Q6322802) (← links)
- Fair allocation of indivisible items with conflict graphs (Q6337395) (← links)
- Complexity and algorithms for constant diameter augmentation problems (Q6350295) (← links)
- Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure (Q6403600) (← links)
- Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem (Q6512765) (← links)
- Detecting $K_{2,3}$ as an induced minor (Q6521576) (← links)
- Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star (Q6522235) (← links)
- Tree decompositions meet induced matchings: beyond Max Weight Independent Set (Q6523247) (← links)
- On balanceable and simply balanceable regular graphs (Q6525267) (← links)
- The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs (Q6530827) (← links)
- Excluding a clique or a biclique in graphs of bounded induced matching treewidth (Q6533742) (← links)
- Bisimplicial separators (Q6565812) (← links)
- Graphs with at most two moplexes (Q6595515) (← links)
- On constrained intersection representations of graphs and digraphs (Q6602458) (← links)
- On balanceable and simply balanceable regular graphs (Q6655683) (← links)
- Non realizable degree sequences of dual graphs on surfaces (Q6702295) (← links)
- On Minimal Transversals of Maximal Cliques in Graphs (Q6729141) (← links)
- A tame vs. feral dichotomy for graph classes excluding an induced minor or induced topological minor (Q6729966) (← links)
- Treewidth versus clique number: induced minors (Q6750112) (← links)
- Young domination on Hamming rectangles (Q6761358) (← links)
- Tree independence number V. Walls and claws (Q6764532) (← links)
