Kernels and partial line digraphs
From MaRDI portal
Publication:990794
Recommendations
Cites work
- scientific article; zbMATH DE number 3902654 (Why is no real title available?)
- scientific article; zbMATH DE number 3771630 (Why is no real title available?)
- scientific article; zbMATH DE number 3405983 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- (k,l)-kernels in line digraphs
- A combinatorial problem in logic
- Hex strategy: making the right connections
- Line Digraph Iterations and the (d, k) Digraph Problem
- On the linegraph of a directed-graph
- Recent problems and results about kernels in directed graphs
- Semikernels and (k,l)-Kernels in Digraphs
- Solutions of irreflexive relations
- The partial line digraph technique in the design of large interconnection networks
Cited in
(12)- (k,l)-kernels in line digraphs
- scientific article; zbMATH DE number 6784970 (Why is no real title available?)
- Semikernels and (k,l)-Kernels in Digraphs
- Linear kernels for separating a graph into components of bounded size
- Miscellaneous digraph classes
- About \((k, l)\)-kernels, semikernels and Grundy functions in partial line digraphs
- scientific article; zbMATH DE number 5178709 (Why is no real title available?)
- Semikernels modulo \(F\) and kernels in digraphs
- scientific article; zbMATH DE number 6194066 (Why is no real title available?)
- Kernels in weighted digraphs
- A parity digraph has a kernel
- Relation between number of kernels (and generalizations) of a digraph and its partial line 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)