The following pages link to Christian Rubio-Montiel (Q292238):
Displaying 40 items.
- Geometric achromatic and pseudoachromatic indices (Q292239) (← links)
- (Q510594) (redirect page) (← links)
- The achromatic number of Kneser graphs (Q510596) (← links)
- Complete colorings of planar graphs (Q1727729) (← links)
- On the pseudoachromatic index of the complete graph. III (Q1743683) (← links)
- The diachromatic number of digraphs (Q1784278) (← links)
- On line colorings of finite projective spaces (Q2045382) (← links)
- A strengthening of the Erdős-Szekeres theorem (Q2065993) (← links)
- Improved bounds for some facially constrained colorings (Q2107748) (← links)
- A polynomial version of Cereceda's conjecture (Q2131856) (← links)
- The digrundy number of digraphs (Q2142695) (← links)
- Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles (Q2181224) (← links)
- On the pseudoachromatic index of the complete graph. II (Q2254689) (← links)
- Coloring decompositions of complete geometric graphs (Q2338577) (← links)
- Pseudoachromatic and connected-pseudoachromatic indices of the complete graph (Q2403793) (← links)
- The Hadwiger number, chordal graphs and \(ab\)-perfection (Q2409752) (← links)
- On crossing families of complete geometric graphs (Q2416466) (← links)
- Achromatic numbers for circulant graphs and digraphs (Q2656326) (← links)
- (Q3303467) (← links)
- On $\omega \psi$-Perfect Graphs (Q4558672) (← links)
- The 4-girth-thickness of the complete graph (Q4577870) (← links)
- The 6-girth-thickness of the complete graph (Q4956180) (← links)
- On the 4-girth-thickness of the line graph of the complete graph (Q4989611) (← links)
- A new characterization of trivially perfect graphs (Q5006549) (← links)
- The 4-girth-thickness of the complete multipartite graph (Q5009944) (← links)
- Achromatic numbers of Kneser graphs (Q5013343) (← links)
- Motions of a connected subgraph representing a swarm of robots inside a graph of work stations (Q5054048) (← links)
- On two-quotient strong starters for $\mathbb{F}_q$ (Q5133099) (← links)
- On transversal and 2-packing numbers in uniform linear systems (Q5154597) (← links)
- A note on the Erd\"os-Faber-Lov\'asz Conjecture: quasigroups and complete digraphs (Q5206391) (← links)
- On chromatic indices of finite affine spaces (Q5225024) (← links)
- A note on m-factorizations of complete multigraphs arising from designs (Q5500496) (← links)
- Achromatic arboricity on complete graphs (Q6122411) (← links)
- Extremal regular graphs of given chromatic number (Q6503478) (← links)
- A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs (Q6517862) (← links)
- Genetic algorithm and edge-colorings of complete graphs with connected classes (Q6533095) (← links)
- Extremal regular graphs of given chromatic number. (Q6550693) (← links)
- On the harmonious chromatic number of graphs (Q6564837) (← links)
- On \(\lambda\)-backbone coloring of cliques with tree backbones in linear time (Q6595513) (← links)
- The dib-chromatic number of digraphs (Q6754485) (← links)
