On the public citation graph

k -kernels in k -transitive and k -quasi-transitive digraphs

0 signed · 84 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1097-0118(200003)33:3<177::aid-jgt8>3.0.co;2-1openalex-snapshot
Kings in semicomplete multipartite digraphs
inferredcites →https://doi.org/10.1002/jgt.3190200205openalex-snapshot
Quasi‐transitive digraphs
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-1-4471-3886-0openalex-snapshot
Digraphs Theory Algorithms And Applications
inferredcites →https://doi.org/10.1007/bf01142481openalex-snapshot
The radii of n-partite tournaments
inferredcites →https://doi.org/10.1007/bf02099507openalex-snapshot
Geometry of quantum principal bundles I
inferredcites →https://doi.org/10.1007/bfb0066192openalex-snapshot
Every directed graph has a semi-kernel
inferredcites →https://doi.org/10.1007/s00032-011-0147-6openalex-snapshot
Self-focusing Multibump Standing Waves in Expanding Waveguides
inferredcites →https://doi.org/10.1007/s00446-010-0108-2openalex-snapshot
New combinatorial topology bounds for renaming: the lower bound
inferredcites →https://doi.org/10.1016/0012-365x(77)90018-8openalex-snapshot
A combinatorial problem in logic
inferredcites →https://doi.org/10.1016/0012-365x(90)90346-jopenalex-snapshot
Recent problems and results about kernels in directed graphs
inferredcites →https://doi.org/10.1016/0012-365x(91)90380-kopenalex-snapshot
Kings in k-partite tournaments
inferredcites →https://doi.org/10.1016/0012-365x(92)90713-popenalex-snapshot
On the existence of kernels and h-kernels in directed graphs
inferredcites →https://doi.org/10.1016/0012-365x(93)e0035-3openalex-snapshot
About quasi-kernels in a digraph
inferredcites →https://doi.org/10.1016/0012-365x(94)00169-jopenalex-snapshot
Kings in multipartite tournaments
inferredcites →https://doi.org/10.1016/j.dam.2012.10.008openalex-snapshot
A note on the upper bound and girth pair of (k;g) -cages
inferredcites →https://doi.org/10.1016/j.disc.2004.01.011openalex-snapshot
The structure of strong arc-locally semicomplete digraphs
inferredcites →https://doi.org/10.1016/j.disc.2005.11.095openalex-snapshot
3-Kings in 3-partite tournaments
inferredcites →https://doi.org/10.1016/j.disc.2005.12.031openalex-snapshot
Perfect graphs, kernels, and cores of cooperative games
inferredcites →https://doi.org/10.1016/j.disc.2006.02.015openalex-snapshot
Kernels in quasi-transitive digraphs
inferredcites →https://doi.org/10.1016/j.disc.2006.04.023openalex-snapshot
On the 3-kings and 4-kings in multipartite tournaments
inferredcites →https://doi.org/10.1016/j.disc.2007.08.078openalex-snapshot
On the existence and on the number of (k,l) -kernels in the lexicographic product of graphs
inferredcites →https://doi.org/10.1016/j.disc.2010.06.008openalex-snapshot
On the structure of strong 3-quasi-transitive digraphs
inferredcites →https://doi.org/10.1016/j.disc.2010.09.022openalex-snapshot
Kernels by monochromatic paths in digraphs with covering number 2
inferredcites →https://doi.org/10.1016/j.disc.2010.11.009openalex-snapshot
Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs
inferredcites →https://doi.org/10.1016/j.endm.2009.07.010openalex-snapshot
A classification of arc-locally semicomplete digraphs
inferredcites →https://doi.org/10.1016/j.matpur.2011.06.005openalex-snapshot
The Kalman condition for the boundary controllability of coupled parabolic systems. Bounds on biorthogonal families to complex matrix exponentials
inferredcites →https://doi.org/10.1016/s0012-365x(96)00064-7openalex-snapshot
On (k, l)-kernels in generalized products
inferredcites →https://doi.org/10.1016/s0012-365x(97)00179-9openalex-snapshot
Kings in quasi-transitive digraphs
inferredcites →https://doi.org/10.1080/03605302.2013.771657openalex-snapshot
Alternating Sign Multibump Solutions of Nonlinear Elliptic Equations in Expanding Tubular Domains
inferredcites →https://doi.org/10.1080/09728600.2011.12088942openalex-snapshot
K-Kernels in Multipartite Tournaments
inferredcites →https://doi.org/10.1090/mbk/121/32openalex-snapshot
Theory of games and economic behavior
inferredcites →https://doi.org/10.1109/icnc.2010.5582557openalex-snapshot
Applying DNA computing to diagnose-and-interfere hepatic fibrosis
inferredcites →https://doi.org/10.1145/2108242.2108245openalex-snapshot
New combinatorial topology bounds for renaming
inferredcites →https://doi.org/10.11575/cdm.v7i2.62146.g46744openalex-snapshot
Tournaments with kernels by monochromatic paths
inferredcites →https://doi.org/10.1214/09-ps154openalex-snapshot
Proof(s) of the Lamperti representation of continuous-state branching processes
inferredcites →https://doi.org/10.1214/ejp.v14-637openalex-snapshot
On the asymptotic behaviour of increasing self-similar Markov processes
inferredcites →https://doi.org/10.3934/mcrf.2014.4.17openalex-snapshot
Controllability to trajectories for some parabolic systems of three and two equations by one control force
inferredcites →https://doi.org/10.7151/dmgt.1373openalex-snapshot
On (k,l)-kernels in D-join of digraphs
inferredcites →https://doi.org/10.7151/dmgt.1406openalex-snapshot
Monochromatic paths and quasi-monochromatic cycles in edge-coloured bipartite tournaments
inferredcites →https://doi.org/10.7151/dmgt.1449openalex-snapshot
Directed hypergraphs: A tool for researching digraphs and hypergraphs
inferredcites →https://doi.org/10.7151/dmgt.1451openalex-snapshot
Monochromatic paths and monochromatic sets of arcs in bipartite tournaments
inferredcites →https://doi.org/10.7151/dmgt.1512openalex-snapshot
Monochromatic paths and monochromatic sets of arcs in quasi-transitive digraphs
inferredcites →https://doi.org/10.7151/dmgt.1530openalex-snapshot
Cyclically k-partite digraphs and k-kernels
inferredcites →https://doi.org/10.7151/dmgt.1544openalex-snapshot
Kernels by monochromatic paths and the color-class digraph
inferredcites →https://doi.org/10.7151/dmgt.1545openalex-snapshot
Monochromatic cycles and monochromatic paths in arc-colored digraphs
inferredcites →https://doi.org/10.7151/dmgt.1546openalex-snapshot
k-kernels in generalizations of transitive digraphs
inferredcites →https://doi.org/10.7151/dmgt.1613openalex-snapshot
3-transitive digraphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4494891openalex-extracted
Strong $K$-Transitive Oriented Graphs with Large Minimum Degree
inferred← citeshttps://doi.org/10.1002/jgt.21814openalex-snapshot
k‐Kings in k‐Quasitransitive Digraphs
inferred← citeshttps://doi.org/10.1002/jgt.22614openalex-snapshot
k‐quasi‐transitive digraphs of large diameter
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_11openalex-snapshot
Miscellaneous Digraph Classes
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_8openalex-snapshot
Quasi-Transitive Digraphs and Their Extensions
inferred← citeshttps://doi.org/10.1007/s00373-013-1367-zopenalex-snapshot
On Panchromatic Digraphs and the Panchromatic Number
inferred← citeshttps://doi.org/10.1007/s00454-011-9379-zopenalex-snapshot
A Generalisation of Tverberg’s Theorem
inferred← citeshttps://doi.org/10.1007/s40590-022-00484-xopenalex-snapshot
(H, k)-reachability in H-arc-colored digraphs
inferred← citeshttps://doi.org/10.1016/j.amc.2021.126319openalex-snapshot
Pancyclicity in strong k -quasi-transitive digraphs of large diameter
inferred← citeshttps://doi.org/10.1016/j.dam.2012.04.019openalex-snapshot
-colored kernels
inferred← citeshttps://doi.org/10.1016/j.dam.2020.06.011openalex-snapshot
Seymour’s second neighborhood conjecture for 5-anti-transitive oriented graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.12.026openalex-snapshot
Seymour’s Second Neighborhood Conjecture for 6-antitransitive digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.08.011openalex-snapshot
Seymour’s second neighborhood conjecture for m -free, k -transitive, k -anti-transitive digraphs and some approaches
inferred← citeshttps://doi.org/10.1016/j.dam.2023.05.012openalex-snapshot
A note on Seymour’s second neighborhood conjecture
inferred← citeshttps://doi.org/10.1016/j.dam.2025.08.014openalex-snapshot
Critical Kernel Imperfectness in 4-quasi-transitive digraphs and 4-anti-transitive digraphs of small diameter
inferred← citeshttps://doi.org/10.1016/j.dam.2026.04.014openalex-snapshot
A note on the second neighborhood problem for k-anti-transitive digraphs with large girth
inferred← citeshttps://doi.org/10.1016/j.disc.2013.08.007openalex-snapshot
On the existence and number of (k+1) -kings in k -quasi-transitive digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2014.08.009openalex-snapshot
( k + 1 ) -kernels and the number of k -kings in k -quasi-transitive digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.02.020openalex-snapshot
Hamiltonian paths in k -quasi-transitive digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2017.10.006openalex-snapshot
On the existence of 3 - and 4 -kernels in digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114700openalex-snapshot
On the k-linkage problem for generalizations of semicomplete digraphs
inferred← citeshttps://doi.org/10.1016/j.endm.2017.10.037openalex-snapshot
k-quasi-transitive digraphs of large diameter
inferred← citeshttps://doi.org/10.1155/2022/1463016openalex-snapshot
Seymour’s Second Neighborhood Conjecture for m-Free Oriented Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1610.05730openalex-snapshot
On the existence of $3$- and $4$-kernels in digraphs
inferred← citeshttps://doi.org/10.5539/jmr.v4n6p43openalex-snapshot
Generalization of Transitive Cayley Digraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1546openalex-snapshot
k-kernels in generalizations of transitive digraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1613openalex-snapshot
3-transitive digraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1680openalex-snapshot
Underlying graphs of 3-quasi-transitive digraphs and 3-transitive digraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1727openalex-snapshot
On the complexity of the 3-kernel problem in some classes of digraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1747openalex-snapshot
On the existence of (k,l)-kernels in infinite digraphs: A survey
inferred← citeshttps://doi.org/10.7151/dmgt.1765openalex-snapshot
On the structure of strong k-transitive digraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1787openalex-snapshot
(k-1)-kernels in strong k-transitive digraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1922openalex-snapshot
Some results on 4-transitive digraphs
inferred← citeshttps://doi.org/10.7151/dmgt.2187openalex-snapshot
Hamilton cycle problem in strong k-quasi-transitive digraphs with large diameter
inferred← citeshttps://doi.org/10.7151/dmgt.2463openalex-snapshot
$(k,H)$-kernels in nearly tournaments
inferred← citeshttps://doi.org/10.7151/dmgt.2494openalex-snapshot
An analogue of quasi-transitivity for edge-coloured graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.