SIAM Journal on Discrete Mathematics, ISSN 0895-4801, 2008, Volume 22, Issue 4, pp. 1624 - 1639

For digraphs D and H, a mapping f : V (D). V (H) is a homomorphism of D to H if uv is an element of A(D) implies f(u) f(v) is an element of A(H...

Homomorphisms | Minimum cost homomorphisms | Semicomplete bipartite digraphs | homomorphisms | MATHEMATICS, APPLIED | minimum cost homomorphisms | semicomplete bipartite digraphs | DICHOTOMY | GRAPHS

Homomorphisms | Minimum cost homomorphisms | Semicomplete bipartite digraphs | homomorphisms | MATHEMATICS, APPLIED | minimum cost homomorphisms | semicomplete bipartite digraphs | DICHOTOMY | GRAPHS

Journal Article

Discrete Mathematics, ISSN 0012-365X, 2009, Volume 309, Issue 23, pp. 6555 - 6562

A digraph is arc-locally in-semicomplete if for any pair of adjacent vertices x , y , every in-neighbor of x and every in-neighbor of y either are adjacent or are the same vertex...

Arc-locally semicomplete digraphs | Semicomplete digraphs | Semicomplete bipartite digraphs | Digraphs | MATHEMATICS | PATHS

Arc-locally semicomplete digraphs | Semicomplete digraphs | Semicomplete bipartite digraphs | Digraphs | MATHEMATICS | PATHS

Journal Article

Discrete Mathematics, ISSN 0012-365X, 2008, Volume 308, Issue 12, pp. 2564 - 2570

.... Let T be a semicomplete multipartite digraph with no transmitters and let K r ( T ) denote the set of r-kings...

Semicomplete multipartite digraphs | Multipartite tournaments | Distances | Kings | MATHEMATICS | distances | 4-KINGS | NUMBER | multipartite tournaments | BIPARTITE TOURNAMENTS | semicomplete multipartite digraphs | kings | PARTITE TOURNAMENTS | 3-KINGS

Semicomplete multipartite digraphs | Multipartite tournaments | Distances | Kings | MATHEMATICS | distances | 4-KINGS | NUMBER | multipartite tournaments | BIPARTITE TOURNAMENTS | semicomplete multipartite digraphs | kings | PARTITE TOURNAMENTS | 3-KINGS

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 1097-0118, 2019, Volume 93, Issue 1, pp. 88 - 112

...‐strong bipartite tournament, which needs at least r colours in every out‐colouring. Our main results are on tournaments and semicomplete digraphs...

Paley tournament | tournaments | degree constrained partitioning of digraphs | semicomplete digraphs | polynomial algorithm | out‐colourings | probabilistic method | MATHEMATICS | out-colourings

Paley tournament | tournaments | degree constrained partitioning of digraphs | semicomplete digraphs | polynomial algorithm | out‐colourings | probabilistic method | MATHEMATICS | out-colourings

Journal Article

Graphs and combinatorics, ISSN 1435-5914, 2019, Volume 35, Issue 3, pp. 669 - 675

Kernel is an important topic in digraphs. A digraph such that every proper induced subdigraph has a kernel is said to be critical kernel imperfect (CKI, for short...

Arc-locally in-semicomplete digraph | 05C20 | Generalization of bipartite tournaments | CKI-digraph | Mathematics | Engineering Design | Combinatorics | 3-Anti-quasi-transitive digraph | 05C69 | Kernel | 3-Quasi-transitive digraph | MATHEMATICS | Kernels | Asymmetry | Graph theory

Arc-locally in-semicomplete digraph | 05C20 | Generalization of bipartite tournaments | CKI-digraph | Mathematics | Engineering Design | Combinatorics | 3-Anti-quasi-transitive digraph | 05C69 | Kernel | 3-Quasi-transitive digraph | MATHEMATICS | Kernels | Asymmetry | Graph theory

Journal Article

DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, ISSN 1462-7264, 2018, Volume 20, Issue 2

A digraph such that every proper induced subdigraph has a kernel is said to be kernel perfect (KP for short...

COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS | MATHEMATICS, APPLIED | asymmetric arc-locally in-/out-semicomplete digraph | kernel | asymmetric 3-(anti)-quasi-transitive digraph | locally in-/out-semicomplete digraph | perfect graph | kernel perfect digraph | LOGIC | GRAPHS

COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS | MATHEMATICS, APPLIED | asymmetric arc-locally in-/out-semicomplete digraph | kernel | asymmetric 3-(anti)-quasi-transitive digraph | locally in-/out-semicomplete digraph | perfect graph | kernel perfect digraph | LOGIC | GRAPHS

Journal Article

Journal of Algorithms, ISSN 0196-6774, 10/2001, Volume 41, Issue 1, pp. 1 - 19

.... We characterize the number of arcs in a minimum spanning strong subdigraph for digraphs which are either extended semicomplete or semicomplete bipartite...

semicomplete multipartite digraph | Hamiltonian cycle | path-mergeable digraph | Hamiltonian path | polynomial algorithm | path covering | multipartite tournament | cycle factor | locally semicomplete digraphs | minimum equivalent digraph | Minimum equivalent digraph | Multipartite tournament | Cycle factor | Locally semicomplete digraphs | Semicomplete multipartite digraph | Path covering | Polynomial algorithm | Path-mergeable digraph | GRAPH | PATHS | ALGORITHMS | LOGIC | TOURNAMENTS | COMPLEXITY

semicomplete multipartite digraph | Hamiltonian cycle | path-mergeable digraph | Hamiltonian path | polynomial algorithm | path covering | multipartite tournament | cycle factor | locally semicomplete digraphs | minimum equivalent digraph | Minimum equivalent digraph | Multipartite tournament | Cycle factor | Locally semicomplete digraphs | Semicomplete multipartite digraph | Path covering | Polynomial algorithm | Path-mergeable digraph | GRAPH | PATHS | ALGORITHMS | LOGIC | TOURNAMENTS | COMPLEXITY

Journal Article

Discrete Mathematics, ISSN 0012-365X, 2010, Volume 310, Issue 19, pp. 2495 - 2498

... = z . In Bang-Jensen (2004) [3], Bang-Jensen introduced 3-quasi-transitive digraphs and claimed that the only strong 3-quasi-transitive digraphs are the strong semicomplete digraphs and strong semicomplete bipartite digraphs...

Arc-locally semicomplete digraphs | Hamiltonian digraphs | 3-quasi-transitive digraphs | Generalization of tournaments | MATHEMATICS | Mathematical analysis | Graphs

Arc-locally semicomplete digraphs | Hamiltonian digraphs | 3-quasi-transitive digraphs | Generalization of tournaments | MATHEMATICS | Mathematical analysis | Graphs

Journal Article

JOURNAL OF GRAPH THEORY, ISSN 0364-9024, 03/2000, Volume 33, Issue 3, pp. 177 - 183

A digraph obtained by replacing each edge of a complete p-partite graph by an are or a pair of mutually opposite arcs with the same end vertices is called a semicomplete p-partite digraph, or just a...

MATHEMATICS | distances | NUMBER | multipartite tournaments | BIPARTITE TOURNAMENTS | semicomplete multipartite digraphs | kings

MATHEMATICS | distances | NUMBER | multipartite tournaments | BIPARTITE TOURNAMENTS | semicomplete multipartite digraphs | kings

Journal Article

Graphs and Combinatorics, ISSN 0911-0119, 9/2011, Volume 27, Issue 5, pp. 669 - 683

The vertex set of a digraph D is denoted by V(D). A c-partite tournament is an orientation of a complete c-partite graph. Let V 1, V 2...

Multipartite tournaments | 05C20 | Weakly complementary cycles | Mathematics | Engineering Design | Combinatorics | MATHEMATICS | BIPARTITE TOURNAMENTS | VERTEX | LOCALLY SEMICOMPLETE DIGRAPHS | FIXED ARC | Computer science | Graphs | Graph theory | Orientation | Combinatorial analysis

Multipartite tournaments | 05C20 | Weakly complementary cycles | Mathematics | Engineering Design | Combinatorics | MATHEMATICS | BIPARTITE TOURNAMENTS | VERTEX | LOCALLY SEMICOMPLETE DIGRAPHS | FIXED ARC | Computer science | Graphs | Graph theory | Orientation | Combinatorial analysis

Journal Article

Journal of Graph Theory, ISSN 0364-9024, 10/1998, Volume 29, Issue 2, pp. 111 - 132

We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite digraphs...

semicomplete multipartite digraph | polynomial algorithm | multipartite tournament | Hamiltonian cycle | cycle through specified vertices | Semicomplete multipartite digraph | Cycle through specified vertices | Polynomial algorithm | Multipartite tournament | MATHEMATICS | BIPARTITE TOURNAMENTS | PATHS

semicomplete multipartite digraph | polynomial algorithm | multipartite tournament | Hamiltonian cycle | cycle through specified vertices | Semicomplete multipartite digraph | Cycle through specified vertices | Polynomial algorithm | Multipartite tournament | MATHEMATICS | BIPARTITE TOURNAMENTS | PATHS

Journal Article

Discrete Mathematics, ISSN 0012-365X, 2002, Volume 245, Issue 1, pp. 19 - 53

A tournament is an orientation of a complete graph, and in general a multipartite tournament is an orientation of a complete n-partite graph. Many results...

Multipartite tournaments | Cycles | Pancyclicity | Hamiltonian cycles | pancyclicity | hamiltonian cycles | ALGORITHM | LENGTHS | cycles | PANCYCLIC ORIENTED GRAPHS | COMPLEMENTARY CYCLES | MATHEMATICS | multipartite tournaments | VERTEX | LOCALLY SEMICOMPLETE DIGRAPHS | DIREGULAR BIPARTITE TOURNAMENTS | FIXED ARC | VERTICES | LONGEST PATHS

Multipartite tournaments | Cycles | Pancyclicity | Hamiltonian cycles | pancyclicity | hamiltonian cycles | ALGORITHM | LENGTHS | cycles | PANCYCLIC ORIENTED GRAPHS | COMPLEMENTARY CYCLES | MATHEMATICS | multipartite tournaments | VERTEX | LOCALLY SEMICOMPLETE DIGRAPHS | DIREGULAR BIPARTITE TOURNAMENTS | FIXED ARC | VERTICES | LONGEST PATHS

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 2008, Volume 156, Issue 12, pp. 2429 - 2435

For digraphs D and H , a mapping f : V ( D ) → V ( H ) is a homomorphism of D to H if u v ∈ A ( D ) implies f ( u ) f ( v ) ∈ A ( H...

Minimum cost homomorphism | Semicomplete multipartite digraphs | semicomplete multipartite digraphs | MATHEMATICS, APPLIED | minimum cost homomorphism | COMPLEXITY | GRAPHS

Minimum cost homomorphism | Semicomplete multipartite digraphs | semicomplete multipartite digraphs | MATHEMATICS, APPLIED | minimum cost homomorphism | COMPLEXITY | GRAPHS

Journal Article

15.
Full Text
On the complexity of hamiltonian path and cycle problems in certain classes of digraphs

Discrete Applied Mathematics, ISSN 0166-218X, 1999, Volume 95, Issue 1, pp. 41 - 60

We survey results on the sequential and parallel complexity of hamiltonian path and cycle problems in various classes of digraphs which generalize tournaments...

Parallel algorithm | Hamiltonian cycle | Multipartite tournament | Hamiltonian path | Hamiltonian connected | Cycle factor | Locally semicomplete digraphs | Semicomplete multipartite digraph | Flows | Path factor | Path covering | Polynomial algorithm | In-semicomplete digraph | Longest path | Decomposable digraph | Quasi-transitive digraph | Path-mergeable digraph | Semicomplete multipartite | hamiltonian cycle | semicomplete multipartite digraph | hamiltonian connected | MATHEMATICS, APPLIED | hamiltonian path | longest path | parallel algorithm | polynomial algorithm | path covering | multipartite tournament | cycle factor | locally semicomplete digraphs | decomposable digraph | SEMICOMPLETE MULTIPARTITE DIGRAPHS | quasi-transitive digraph | in-semicomplete digraph | path factor | flows | path-mergeable digraph | BIPARTITE TOURNAMENTS

Parallel algorithm | Hamiltonian cycle | Multipartite tournament | Hamiltonian path | Hamiltonian connected | Cycle factor | Locally semicomplete digraphs | Semicomplete multipartite digraph | Flows | Path factor | Path covering | Polynomial algorithm | In-semicomplete digraph | Longest path | Decomposable digraph | Quasi-transitive digraph | Path-mergeable digraph | Semicomplete multipartite | hamiltonian cycle | semicomplete multipartite digraph | hamiltonian connected | MATHEMATICS, APPLIED | hamiltonian path | longest path | parallel algorithm | polynomial algorithm | path covering | multipartite tournament | cycle factor | locally semicomplete digraphs | decomposable digraph | SEMICOMPLETE MULTIPARTITE DIGRAPHS | quasi-transitive digraph | in-semicomplete digraph | path factor | flows | path-mergeable digraph | BIPARTITE TOURNAMENTS

Journal Article

Graphs and combinatorics, ISSN 1435-5914, 2019, Volume 35, Issue 4, pp. 921 - 931

Let k be a positive integer and let D be a digraph. A path partition $$\mathcal {P}$$ P of D is a set of vertex-disjoint paths which covers...

Coloring | Berge’s Conjecture | Mathematics | Engineering Design | Combinatorics | Path partition | Locally in-semicomplete digraphs | Aharoni, Hartman, and Hoffman’s Conjecture | MATHEMATICS | Berge's Conjecture | Aharoni | Hartman | and Hoffman's Conjecture | Olefins | Collection | Partitions | Graph theory | Apexes | Weight

Coloring | Berge’s Conjecture | Mathematics | Engineering Design | Combinatorics | Path partition | Locally in-semicomplete digraphs | Aharoni, Hartman, and Hoffman’s Conjecture | MATHEMATICS | Berge's Conjecture | Aharoni | Hartman | and Hoffman's Conjecture | Olefins | Collection | Partitions | Graph theory | Apexes | Weight

Journal Article

JOURNAL OF GRAPH THEORY, ISSN 0364-9024, 08/1998, Volume 28, Issue 4, pp. 171 - 202

... "tournament-like" digraphs. (C) 1998 John Wiley & Sons, Inc.

PROPER INTERVAL-GRAPHS | Hamiltonian cycle | Hamiltonian path | PATHS | locally semicomplete digraphs | path-mergable digraph | pancyclicity Phi-decomposable | CIRCULAR-ARC GRAPHS | COMPLEMENTARY CYCLES | MATHEMATICS | DIAMETER | longest paths | REPRESENTATION ALGORITHMS | ORIENTATION | quasi-transitive digraphs | BIPARTITE TOURNAMENTS | MULTIPARTITE TOURNAMENTS

PROPER INTERVAL-GRAPHS | Hamiltonian cycle | Hamiltonian path | PATHS | locally semicomplete digraphs | path-mergable digraph | pancyclicity Phi-decomposable | CIRCULAR-ARC GRAPHS | COMPLEMENTARY CYCLES | MATHEMATICS | DIAMETER | longest paths | REPRESENTATION ALGORITHMS | ORIENTATION | quasi-transitive digraphs | BIPARTITE TOURNAMENTS | MULTIPARTITE TOURNAMENTS

Journal Article

Journal of Graph Theory, ISSN 0364-9024, 05/2015, Volume 79, Issue 1, pp. 8 - 20

.... Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian...

semicomplete multipartite digraph | quasitransitive digraph | spanning closed trail | independence number | arc‐connectivity | supereulerian digraph | degree conditions | arc-connectivity | CIRCUITS | MATHEMATICS | GRAPHS

semicomplete multipartite digraph | quasitransitive digraph | spanning closed trail | independence number | arc‐connectivity | supereulerian digraph | degree conditions | arc-connectivity | CIRCUITS | MATHEMATICS | GRAPHS

Journal Article

The Computer Journal, ISSN 0010-4620, 5/2008, Volume 51, Issue 3, pp. 363 - 371

We survey results and open questions on complexity of parameterized problems on digraphs...

Diagraphs | Parameterized algorithm | FPT ALGORITHM | SEMICOMPLETE DIGRAPHS | FEEDBACK SET PROBLEMS | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | SEARCH | LENGTH | COMPUTER SCIENCE, INFORMATION SYSTEMS | diagraphs | TRACTABILITY | RANKING | COMPUTER SCIENCE, SOFTWARE ENGINEERING | PAIRED-COMPARISON DIGRAPH | TOURNAMENTS | VERTICES | parameterized algorithm | Computer science | Graphs | Algorithms | Parameter optimization

Diagraphs | Parameterized algorithm | FPT ALGORITHM | SEMICOMPLETE DIGRAPHS | FEEDBACK SET PROBLEMS | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | SEARCH | LENGTH | COMPUTER SCIENCE, INFORMATION SYSTEMS | diagraphs | TRACTABILITY | RANKING | COMPUTER SCIENCE, SOFTWARE ENGINEERING | PAIRED-COMPARISON DIGRAPH | TOURNAMENTS | VERTICES | parameterized algorithm | Computer science | Graphs | Algorithms | Parameter optimization

Journal Article

Algorithmica, ISSN 0178-4617, 1/1997, Volume 17, Issue 1, pp. 67 - 87

We give anO(log4 n)-timeO(n 2)-processor CRCW PRAM algorithm to find a hamiltonian cycle in a strong semicomplete bipartite digraph,B, provided that a factor ofB (i.e...

Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Algorithms | Mathematics of Computing | Computer Science | Hamilton cycle | Semicomplete bipartite graphs | Randomized algorithms | Theory of Computation | Graph algorithms | Algorithm Analysis and Problem Complexity | Parallel algorithms | parallel algorithms | MATHEMATICS, APPLIED | randomized algorithms | TOURNAMENTS | K PN MATHEMATICS, APPLIED | K EW COMPUTER SCIENCE, SOFTWARE, GRAPHICS, PROGRAMMING | COMPUTER SCIENCE, SOFTWARE, GRAPHICS, PROGRAMMING | semicomplete bipartite graphs | graph algorithms

Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Algorithms | Mathematics of Computing | Computer Science | Hamilton cycle | Semicomplete bipartite graphs | Randomized algorithms | Theory of Computation | Graph algorithms | Algorithm Analysis and Problem Complexity | Parallel algorithms | parallel algorithms | MATHEMATICS, APPLIED | randomized algorithms | TOURNAMENTS | K PN MATHEMATICS, APPLIED | K EW COMPUTER SCIENCE, SOFTWARE, GRAPHICS, PROGRAMMING | COMPUTER SCIENCE, SOFTWARE, GRAPHICS, PROGRAMMING | semicomplete bipartite graphs | graph algorithms

Journal Article

No results were found for your search.

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