Ciencias,UNAM

Browsing Repositorio Ciencias by Subject "kernel"

DSpace/Manakin Repository

Browsing Repositorio Ciencias by Subject "kernel"

Sort by: Order: Results:

  • Kernels in pretransitive digraphs
    Rojas-Monroy, R; Galeana-Sánchez, H (2004)
    Let D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respectively. A kernel N of D is an independent set of vertices such that for every w is an element of V(D) - N there exists an are from w ...
  • Kernels in quasi-transitive digraphs
    Rojas-Monroy, R; Galeana-Sánchez, H (2006)
    Let D be a digraph, V (D) and A (D) will denote the sets of vertices and arcs of D, respectively. A kernel N of D is an independent set of vertices such that for every w is an element of V (D) - N there exists an arc from ...
  • Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments
    Rojas-Monroy, R; Galeana-Sánchez, H (2005)
    We call the tournament T an m-coloured tournament if the arcs of T are coloured with m-colours. If v is a vertex of an m- coloured tournament T, we denote by xi(v) the set of colours assigned to the arcs with v as an ...
  • Monochromatic paths and monochromatic cycles in edge-coloured k-partite tournaments
    Rojas-Monroy, R; Galeana-Sánchez, H (2010)
    We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A subdigraph H of D is called monochromatic if all of its arcs are coloured alike. A set N subset of V(D) is said to be a kernel by ...
  • On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments
    Rojas-Monroy, R; Galeana-Sánchez, H (2004)
    We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A directed path (or a directed cycle) is called monochromatic if all of its arcs are coloured alike. A set N subset of or equal to ...

Search DSpace


Advanced Search

Browse

My Account