Kernels and partial line digraphs
From MaRDI portal
Publication:990794
DOI10.1016/J.AML.2010.06.001zbMATH Open1193.05083OpenAlexW2030640478MaRDI QIDQ990794FDOQ990794
Authors: C. Balbuena, Mucuy-kak Guevara 
Publication date: 1 September 2010
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2010.06.001
Recommendations
Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Solutions of irreflexive relations
- A combinatorial problem in logic
- Recent problems and results about kernels in directed graphs
- Line Digraph Iterations and the (d, k) Digraph Problem
- Semikernels and (k,l)-Kernels in Digraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The partial line digraph technique in the design of large interconnection networks
- On the linegraph of a directed-graph
- Hex strategy: making the right connections
- (k,l)-kernels in line digraphs
- Title not available (Why is that?)
Cited In (12)
- About \((k, l)\)-kernels, semikernels and Grundy functions in partial line digraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A parity digraph has a kernel
- Linear kernels for separating a graph into components of bounded size
- Semikernels modulo \(F\) and kernels in digraphs
- Title not available (Why is that?)
- Kernels in weighted digraphs
- (k,l)-kernels in line digraphs
- Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs
- Miscellaneous digraph classes
- Semikernels and (k,l)-Kernels in Digraphs
This page was built for publication: Kernels and partial line digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990794)
