The following pages link to Juan José Montellano-Ballesteros (Q251543):
Displaying 50 items.
- Richardson's theorem for \(k\)-colored kernels in strongly connected digraphs (Q260020) (← links)
- On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids (Q367058) (← links)
- \(k\)-colored kernels (Q442210) (← links)
- Some remarks on the structure of strong \(k\)-transitive digraphs (Q472123) (← links)
- Rainbow connection in some digraphs (Q503612) (← links)
- Monochromatic connecting colorings in strongly connected oriented graphs (Q507473) (← links)
- A Richardson's theorem version for \(\Pi\)-kernels (Q512571) (← links)
- Rainbow connectivity of cacti and of some infinite digraphs (Q521748) (← links)
- Girth, minimum degree and transversals of longest paths (Q547535) (← links)
- An anti-Ramsey theorem on diamonds (Q604664) (← links)
- Cubic time recognition of cocircuit graphs of uniform oriented matroids (Q607364) (← links)
- Vertex-monochromatic connectivity of strong digraphs (Q776297) (← links)
- \(\Pi\)-kernels in digraphs (Q897229) (← links)
- On a heterochromatic number for hypercubes (Q932668) (← links)
- Kernels by monochromatic paths in \(m\)-colored unions of quasi-transitive digraphs (Q968164) (← links)
- (Q1423499) (redirect page) (← links)
- A linear heterochromatic number of graphs (Q1423500) (← links)
- Some heterochromatic theorems for matroids (Q1660247) (← links)
- On the pseudoachromatic index of the complete graph. III (Q1743683) (← links)
- The diachromatic number of digraphs (Q1784278) (← links)
- Counting polytopes via the Radon complex (Q1826858) (← links)
- Polychromatic cliques (Q1877677) (← links)
- A note on the upper bound and girth pair of (\(k;g\))-cages (Q1946230) (← links)
- Extension of Gyárfás-Sumner conjecture to digraphs (Q2030749) (← links)
- On the number of heterochromatic trees in nice and beautiful colorings of complete graphs (Q2062897) (← links)
- An ensemble of high rank matrices arising from tournaments (Q2104983) (← links)
- Transversals of total strict linear orders (Q2140990) (← links)
- The digrundy number of digraphs (Q2142695) (← links)
- An anti-Ramsey theorem of \(k\)-restricted edge-cuts (Q2159228) (← links)
- The crossing number of twisted graphs (Q2163801) (← links)
- On total coloring of some classes of regular graphs (Q2167796) (← links)
- Extremal graphs for odd-ballooning of paths and cycles (Q2175804) (← links)
- A crossing lemma for multigraphs (Q2189737) (← links)
- Optimal proper connection of graphs (Q2192984) (← links)
- On the pseudoachromatic index of the complete graph. II (Q2254689) (← links)
- Hamiltonian cycles in normal Cayley graphs (Q2287760) (← links)
- Mixed cages (Q2334064) (← links)
- Some conditions for the existence of Euler \(H\)-trails (Q2334082) (← links)
- The strong convexity spectra of grids (Q2409510) (← links)
- Facial rainbow edge-coloring of plane graphs (Q2413633) (← links)
- Hamiltonian normal Cayley graphs (Q2416956) (← links)
- Tverberg-type theorems for separoids (Q2492650) (← links)
- A characterization of cocircuit graphs of uniform oriented matroids (Q2496197) (← links)
- A graph-theoretical axiomatization of oriented matroids (Q2509765) (← links)
- An anti-Ramsey theorem on cycles (Q2573806) (← links)
- Strong subtournaments and cycles of multipartite tournaments (Q2629292) (← links)
- Achromatic numbers for circulant graphs and digraphs (Q2656326) (← links)
- Crumby colorings -- red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen (Q2685314) (← links)
- Hamiltonicity in power graphs of a class of abelian groups (Q2688258) (← links)
- (Q2816124) (← links)
