The following pages link to Leandro Montero (Q290527):
Displaying 17 items.
- Proper connection of graphs (Q442366) (← links)
- Almost every graph is divergent under the biclique operator (Q908300) (← links)
- Safe sets in graphs: graph classes and structural parameters (Q1631677) (← links)
- (Q1748201) (redirect page) (← links)
- Tropical dominating sets in vertex-coloured graphs (Q1748204) (← links)
- Vertex removal in biclique graphs (Q2091812) (← links)
- On the iterated edge-biclique operator (Q2132393) (← links)
- Proper Hamiltonian cycles in edge-colored multigraphs (Q2397532) (← links)
- Proper Hamiltonian paths in edge-coloured multigraphs (Q2409503) (← links)
- The number of convergent graphs under the biclique operator with no twin vertices is finite (Q2840544) (← links)
- Further results on strong edge-colourings in outerplanar graphs (Q2947381) (← links)
- Safe Sets in Graphs: Graph Classes and Structural Parameters (Q2958317) (← links)
- On the Iterated Biclique Operator (Q4920658) (← links)
- (Q5026980) (← links)
- Tight lower bounds on the number of bicliques in false-twin-free graphs (Q5890720) (← links)
- Tight lower bounds on the number of bicliques in false-twin-free graphs (Q5890936) (← links)
- On the edge‐biclique graph and the iterated edge‐biclique operator (Q6081559) (← links)
