Discrete Mathematics, ISSN 0012-365X, 11/2013, Volume 313, Issue 22, pp. 2582 - 2591

Let D=(V(D),A(D)) be a digraph and k≥2 an integer. We say that D is k-quasi-transitive if for every directed path (v0,v1,…,vk) in D we have (v0,vk)∈A(D) or (vk,v0)∈A(D...

Quasi-transitive digraph | Digraph | [formula omitted]-quasi-transitive digraph | [formula omitted]-king | Digraph k-king | k-quasi-transitive digraph | MATHEMATICS | 4-KINGS | 3-KINGS | k-king | KINGS

Quasi-transitive digraph | Digraph | [formula omitted]-quasi-transitive digraph | [formula omitted]-king | Digraph k-king | k-quasi-transitive digraph | MATHEMATICS | 4-KINGS | 3-KINGS | k-king | KINGS

Journal Article

Discrete Mathematics, ISSN 0012-365X, 08/2016, Volume 339, Issue 8, pp. 2094 - 2099

Let D=(V(D),A(D)) be a digraph and k be an integer with k≥2. A digraph D is k-quasi-transitive, if for any path x0x1...

[formula omitted]-quasi-transitive digraph | Hamiltonian path | Quasi-transitive digraph | k-quasi-transitive digraph | MATHEMATICS | NUMBER | KINGS

[formula omitted]-quasi-transitive digraph | Hamiltonian path | Quasi-transitive digraph | k-quasi-transitive digraph | MATHEMATICS | NUMBER | KINGS

Journal Article

Discussiones Mathematicae Graph Theory, ISSN 2083-5892, 05/2013, Volume 33, Issue 2, pp. 247 - 260

Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively...

4-transitive digraph | k-quasi-transitive digraph | k-transitive digraph | digraph | transitive digraph | quasi-transitive digraph | K-transitive digraph | Transitive digraph | Quasi-transitive digraph | Digraph | K-quasi-transitive digraph | MATHEMATICS | quasi-transitive digraph,4-transitive digraph

4-transitive digraph | k-quasi-transitive digraph | k-transitive digraph | digraph | transitive digraph | quasi-transitive digraph | K-transitive digraph | Transitive digraph | Quasi-transitive digraph | Digraph | K-quasi-transitive digraph | MATHEMATICS | quasi-transitive digraph,4-transitive digraph

Journal Article

Applied mathematics and computation, ISSN 0096-3003, 2020, Volume 372, p. 124964

A digraph D is supereulerian if D contains a spanning eulerian subdigraph. For any distinct four vertices c1, c2, c3, c4 of D, D is H1-quasi-transitive if c1 → c2 ← c3...

Arc-strong connectivity | Supereulerian digraph | Eulerian factor | Spanning closed ditrail | Independence number | 3-path-quasi-transitive digraph | MATHEMATICS, APPLIED

Arc-strong connectivity | Supereulerian digraph | Eulerian factor | Spanning closed ditrail | Independence number | 3-path-quasi-transitive digraph | MATHEMATICS, APPLIED

Journal Article

Discussiones Mathematicae Graph Theory, ISSN 2083-5892, 05/2013, Volume 33, Issue 2, pp. 429 - 435

A digraph is 3-quasi-transitive (resp. 3-transitive), if for any path x0x1 x2x3 of length 3, x0 and x3 are adjacent (resp. x0 dominates x3). C´esar Hern...

graph orientation | 3-quasi-transitive digraph | 3-transitive digraph | Graph orientation | MATHEMATICS | QUASI-TRANSITIVE DIGRAPHS

graph orientation | 3-quasi-transitive digraph | 3-transitive digraph | Graph orientation | MATHEMATICS | QUASI-TRANSITIVE DIGRAPHS

Journal Article

Discussiones Mathematicae Graph Theory, ISSN 2083-5892, 05/2013, Volume 33, Issue 2, pp. 247 - 260

Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively...

4-transitive digraph | k-quasi-transitive digraph | digraph | k-transitive digraph | transitive digraph | quasi-transitive digraph

4-transitive digraph | k-quasi-transitive digraph | digraph | k-transitive digraph | transitive digraph | quasi-transitive digraph

Journal Article

Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 11/2014, Volume 34, Issue 4, pp. 651 - 671

A digraph D is k-transitive if the existence of a directed path (v0, v1, . . . , vk), of length k implies...

k-quasi-transitive digraph | k-transitive digraph | digraph | Laborde-Payan-Xuong Conjecture | transitive digraph | quasi-transitive digraph | Transitive digraph | Quasi-transitive digraph | Digraph | Laborde-Payan-Xuong conjecture | MATHEMATICS

k-quasi-transitive digraph | k-transitive digraph | digraph | Laborde-Payan-Xuong Conjecture | transitive digraph | quasi-transitive digraph | Transitive digraph | Quasi-transitive digraph | Digraph | Laborde-Payan-Xuong conjecture | MATHEMATICS

Journal Article

Algorithmica, ISSN 0178-4617, 10/2016, Volume 76, Issue 2, pp. 320 - 343

In the Directed Feedback Arc (Vertex) Set problem, we are given a digraph D with vertex set V(D) and arcs set A(D...

Feedback arc set | Feedback vertex set | Theory of Computation | Kernels | Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Algorithms | Mathematics of Computing | Decomposable digraph | Locally semicomplete digraph | Computer Science | Bounded independence number | Quasi-transitive digraph | Algorithm Analysis and Problem Complexity | Parameterized complexity | SEMICOMPLETE DIGRAPHS | MATHEMATICS, APPLIED | NP | VERTEX SET | GRAPHS | COMPUTER SCIENCE, SOFTWARE ENGINEERING | ARC SET | BIPARTITE TOURNAMENTS | Computer science

Feedback arc set | Feedback vertex set | Theory of Computation | Kernels | Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Algorithms | Mathematics of Computing | Decomposable digraph | Locally semicomplete digraph | Computer Science | Bounded independence number | Quasi-transitive digraph | Algorithm Analysis and Problem Complexity | Parameterized complexity | SEMICOMPLETE DIGRAPHS | MATHEMATICS, APPLIED | NP | VERTEX SET | GRAPHS | COMPUTER SCIENCE, SOFTWARE ENGINEERING | ARC SET | BIPARTITE TOURNAMENTS | Computer science

Journal Article

Journal of Graph Theory, ISSN 0364-9024, 06/2017, Volume 85, Issue 2, pp. 545 - 567

The k‐linkage problem is as follows: given a digraph D=(V,A) and a collection of k terminal pairs (s1,t1),…,(sk,tk...

polynomial algorithm | disjoint paths | k‐linkage problem | quasi‐transitive digraph | (round‐)decomposable digraphs | locally semicomplete digraph | (round-)decomposable digraphs | k-linkage problem | quasi-transitive digraph | MATHEMATICS | QUASI-TRANSITIVE DIGRAPHS | TOURNAMENTS | LOCALLY SEMICOMPLETE DIGRAPHS

polynomial algorithm | disjoint paths | k‐linkage problem | quasi‐transitive digraph | (round‐)decomposable digraphs | locally semicomplete digraph | (round-)decomposable digraphs | k-linkage problem | quasi-transitive digraph | MATHEMATICS | QUASI-TRANSITIVE DIGRAPHS | TOURNAMENTS | LOCALLY SEMICOMPLETE DIGRAPHS

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 2010, Volume 158, Issue 5, pp. 461 - 466

A digraph D is a union of quasi-transitive digraphs if its arcs can be partitioned into sets A 1 and A 2 such that the induced subdigraph D [ A i ] ( i = 1 , 2...

Quasi-transitive chromatic class | Kernel by monochromatic paths | [formula omitted]-colored quasi-transitive digraphs | m-colored quasi-transitive digraphs | MATHEMATICS, APPLIED | TOURNAMENTS

Quasi-transitive chromatic class | Kernel by monochromatic paths | [formula omitted]-colored quasi-transitive digraphs | m-colored quasi-transitive digraphs | MATHEMATICS, APPLIED | TOURNAMENTS

Journal Article

Discrete Mathematics, ISSN 0012-365X, 2006, Volume 306, Issue 16, pp. 1969 - 1974

Let D be a digraph, V ( D ) and A ( D ) will denote the sets of vertices and arcs of D, respectively...

Kernel-perfect digraph | Kernel | Quasi-transitive digraph | kernel-perfect digraph | MATHEMATICS | PERFECT | quasi-transitive digraph | kernel | GRAPHS

Kernel-perfect digraph | Kernel | Quasi-transitive digraph | kernel-perfect digraph | MATHEMATICS | PERFECT | quasi-transitive digraph | kernel | GRAPHS

Journal Article

Discussiones Mathematicae Graph Theory, ISSN 2083-5892, 02/2014, Volume 34, Issue 1, pp. 167 - 185

Let D be a digraph with the vertex set V (D) and the arc set A(D). A subset N of V (D) is k-independent if for every pair of vertices u, v...

3-kernel | k-quasi-transitive digraph | multipartite tournament | cyclically 3-partite digraphs | kernel | NP-completeness | Multipartite tournament | Kernel | K-quasi-transitive digraph | Cyclically 3-partite digraphs | MATHEMATICS | QUASI-TRANSITIVE DIGRAPHS | KERNELS

3-kernel | k-quasi-transitive digraph | multipartite tournament | cyclically 3-partite digraphs | kernel | NP-completeness | Multipartite tournament | Kernel | K-quasi-transitive digraph | Cyclically 3-partite digraphs | MATHEMATICS | QUASI-TRANSITIVE DIGRAPHS | KERNELS

Journal Article

Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 08/2014, Volume 34, Issue 3, pp. 431 - 466

Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k, l...

kernel | k-kernel | infinite digraph | l)-kernel | Infinite digraph | K-kernel | Kernel | (k, l)-kernel | MATHEMATICS | NUMBER | QUASI-TRANSITIVE DIGRAPHS | KERNELS | GRAPHS

kernel | k-kernel | infinite digraph | l)-kernel | Infinite digraph | K-kernel | Kernel | (k, l)-kernel | MATHEMATICS | NUMBER | QUASI-TRANSITIVE DIGRAPHS | KERNELS | GRAPHS

Journal Article

Graphs and combinatorics, ISSN 0911-0119, 07/2020, Volume 36, Issue 4, pp. 1247 - 1261

...). If every induced subdigraph of D has a kernel, D is said to be a kernel perfect digraph. In Galeana-Sanchez and Rojas-Monroy (Discrete Math, 275: 129-136, 2004...

Pre-transitive digraph | MATHEMATICS | Quasi-transitive digraph | P-class digraph | Kernel | KERNELS | Kernels | Theorems | Graph theory | Apexes

Pre-transitive digraph | MATHEMATICS | Quasi-transitive digraph | P-class digraph | Kernel | KERNELS | Kernels | Theorems | Graph theory | Apexes

Journal Article

Discrete Mathematics, ISSN 0012-365X, 03/2018, Volume 341, Issue 3, pp. 638 - 651

Let D=(V(D),A(D)) be a digraph. A subset S⊆V(D) is k-independent if the distance between every pair of vertices of S is at least k, and it is...

[formula omitted]-kernel | Kernel-perfect digraph | Kernel | (k,l)-kernel | k-kernel | MATHEMATICS | QUASI-TRANSITIVE DIGRAPHS | (k, l)-kernel | K-KERNELS

[formula omitted]-kernel | Kernel-perfect digraph | Kernel | (k,l)-kernel | k-kernel | MATHEMATICS | QUASI-TRANSITIVE DIGRAPHS | (k, l)-kernel | K-KERNELS

Journal Article

Discrete Mathematics, ISSN 0012-365X, 01/2015, Volume 338, Issue 1, pp. 114 - 121

Let D=(V(D),A(D)) be a digraph and k≥2 be an integer. A vertex x is a k-king of D, if for every y∈V(D), there is an (x,y...

[formula omitted]-kernel | Quasi-transitive digraph | [formula omitted]-quasi-transitive digraph | [formula omitted]-king | k-quasi-transitive digraph | k-king | k-kernel | MATHEMATICS | TOURNAMENTS | KERNELS

[formula omitted]-kernel | Quasi-transitive digraph | [formula omitted]-quasi-transitive digraph | [formula omitted]-king | k-quasi-transitive digraph | k-king | k-kernel | MATHEMATICS | TOURNAMENTS | KERNELS

Journal Article

Discrete Optimization, ISSN 1572-5286, 2008, Volume 5, Issue 1, pp. 121 - 137

We consider the minimum cycle factor problem: given a digraph D , find the minimum number k min ( D...

Quasi-transitive digraph | Network flow | Polynomial algorithm | Irreducible cycle factor | Complementary cycles | Cycle factor | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | network flow | LOCALLY SEMICOMPLETE DIGRAPHS | polynomial algorithm | irreducible cycle factor | cycle factor | complementary cycles | quasi-transitive digraph | MULTIPARTITE DIGRAPHS | Computer science | Algorithms

Quasi-transitive digraph | Network flow | Polynomial algorithm | Irreducible cycle factor | Complementary cycles | Cycle factor | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | network flow | LOCALLY SEMICOMPLETE DIGRAPHS | polynomial algorithm | irreducible cycle factor | cycle factor | complementary cycles | quasi-transitive digraph | MULTIPARTITE DIGRAPHS | Computer science | Algorithms

Journal Article

Journal of Graph Theory, ISSN 0364-9024, 09/2014, Volume 77, Issue 2, pp. 89 - 110

...‐decomposable digraphs, under appropriate hypothesis on Φ. We then apply this and recent results by Fradkin and Seymour (on the weak k...

locally semicomplete digraph | cut‐width | decomposable digraph | quasi‐transitive digraph | arc‐disjoint paths | modular partition | weak linkages | cut-width | arc-disjoint paths | quasi-transitive digraph | MATHEMATICS

locally semicomplete digraph | cut‐width | decomposable digraph | quasi‐transitive digraph | arc‐disjoint paths | modular partition | weak linkages | cut-width | arc-disjoint paths | quasi-transitive digraph | MATHEMATICS

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 07/2017, Volume 226, pp. 44 - 50

In 2014 D. Pálvölgyi and A. Gyárfás explored the minimum dominating set of a digraph with an arc partition into transitive digraphs...

Dominating sets | Quasi-transitive digraphs | Vertex partitions | MATHEMATICS, APPLIED

Dominating sets | Quasi-transitive digraphs | Vertex partitions | MATHEMATICS, APPLIED

Journal Article

Discussiones Mathematicae - Graph Theory, ISSN 1234-3099, 2012, Volume 32, Issue 2, pp. 205 - 219

Let D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respectively...

Transitive digraph | Quasi-transitive digraph | 3-quasi-transitive digraph | 3-transitive digraph | Digraph | Kernel | MATHEMATICS | digraph | kernel | transitive digraph | quasi-transitive digraph

Transitive digraph | Quasi-transitive digraph | 3-quasi-transitive digraph | 3-transitive digraph | Digraph | Kernel | MATHEMATICS | digraph | kernel | transitive digraph | quasi-transitive digraph

Journal Article

No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.