The following pages link to Martín D. Safe (Q324845):
Displaying 44 items.
- On the hereditary \((p,q)\)-Helly property of hypergraphs, cliques, and bicliques (Q324846) (← links)
- Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection (Q344830) (← links)
- Partial characterizations of circle graphs (Q643006) (← links)
- Partial characterization of graphs having a single large Laplacian eigenvalue (Q668039) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Convex \(p\)-partitions of bipartite graphs (Q897926) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time (Q1747105) (← links)
- Labelled packing functions in graphs (Q2011027) (← links)
- A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems (Q2029256) (← links)
- Forbidden induced subgraph characterization of circle graphs within split graphs (Q2091783) (← links)
- Computing the determinant of the distance matrix of a bicyclic graph (Q2132376) (← links)
- 2-nested matrices: towards understanding the structure of circle graphs (Q2152610) (← links)
- Essential obstacles to Helly circular-arc graphs (Q2166233) (← links)
- Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- The determinant of the distance matrix of graphs with blocks at most bicyclic (Q2229502) (← links)
- Covering graphs with convex sets and partitioning graphs into convex sets (Q2308465) (← links)
- On graphs with a single large Laplacian eigenvalue (Q2413188) (← links)
- Forbidden subgraphs and the König-Egerváry property (Q2444529) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- On the generalized Helly property of hypergraphs, cliques, and bicliques (Q2689646) (← links)
- Lochs-type theorems beyond positive entropy (Q2696254) (← links)
- Forbidden subgraphs and the Kőnig property (Q2840731) (← links)
- Probe interval and probe unit interval graphs on superclasses of cographs (Q2840732) (← links)
- (Q2861542) (← links)
- Clique-perfectness and balancedness of some graph classes (Q2931952) (← links)
- Partial Characterizations of Circular-Arc Graphs (Q3503529) (← links)
- Partial characterizations of circular-arc graphs (Q3652535) (← links)
- Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs (Q4986807) (← links)
- Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs (Q4990134) (← links)
- (Q5005653) (← links)
- Fefferman–Stein Inequalities for the Hardy–Littlewood Maximal Function on the Infinite Rooted <i>k</i>-ary Tree (Q5006208) (← links)
- Characterization and linear‐time detection of minimal obstructions to concave‐round graphs and the circular‐ones property (Q5110656) (← links)
- (Q5167720) (← links)
- (Q5249236) (← links)
- Advances in Artificial Intelligence – SBIA 2004 (Q5311226) (← links)
- (Q5747396) (← links)
- Two Arithmetical Sources and Their Associated Tries (Q5874402) (← links)
- On minimal forbidden subgraph characterizations of balanced graphs (Q5891090) (← links)
- Clique-perfectness of complements of line graphs (Q5891101) (← links)
- Clique-perfectness of complements of line graphs (Q5919747) (← links)
- On minimal forbidden subgraph characterizations of balanced graphs (Q5920323) (← links)
- On nested and 2-nested graphs: two subclasses of graphs between threshold and split graphs (Q6321184) (← links)
