X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (4) 4
digraphs (2) 2
discrete mathematics and combinatorics (2) 2
graph theory (2) 2
kernel (2) 2
theoretical computer science (2) 2
05c20 (1) 1
05c69 (1) 1
3-anti-quasi-transitive digraph (1) 1
3-quasi-transitive digraph (1) 1
arc-locally in-semicomplete digraph (1) 1
arc-locally in-semicomplete digraphs (1) 1
arc-locally semicomplete digraphs (1) 1
asymmetric 3--quasi-transitive digraph (1) 1
asymmetric arc-locally in-/out-semicomplete digraph (1) 1
asymmetry (1) 1
cki-digraph (1) 1
combinatorics (1) 1
computer science, software engineering (1) 1
engineering design (1) 1
generalization of bipartite tournaments (1) 1
graphs (1) 1
independent sets (1) 1
kernel perfect digraph (1) 1
kernels (1) 1
locally in-/out-semicomplete digraph (1) 1
logic (1) 1
mathematical analysis (1) 1
mathematics, applied (1) 1
non-augmentable paths (1) 1
paths (1) 1
perfect graph (1) 1
quasi-arc-transitive digraphs (1) 1
semicomplete bipartite digraphs (1) 1
semicomplete digraphs (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


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
Journal Article
Discrete Mathematics, ISSN 0012-365X, 02/2011, Volume 311, Issue 4, pp. 282 - 288
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 in-semicomplete digraphs | Non-augmentable paths | Quasi-arc-transitive digraphs | Independent sets | Digraphs | MATHEMATICS | Mathematical analysis | Graph theory
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
Journal Article
No results were found for your search.

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