The depression of a graph and k-kernels
From MaRDI portal
Publication:2450123
Recommendations
- On the kernels of the incidence matrices of graphs
- On the existence of (k,\(\ell)\)-kernels in digraphs
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs
- The kernels of the incidence matrices of graphs revisited
- On the existence of \((k,k-1)\)-kernels in directed graphs
- scientific article; zbMATH DE number 819126
- scientific article; zbMATH DE number 915661
- On the existence and the number of (\(2\)-\(d\))-kernels in graphs.
- scientific article; zbMATH DE number 89070
Cites work
- scientific article; zbMATH DE number 1055145 (Why is no real title available?)
- scientific article; zbMATH DE number 2147937 (Why is no real title available?)
- scientific article; zbMATH DE number 2174618 (Why is no real title available?)
- A class of graphs with depression three
- A lower bound for the depression of trees
- A monotone path in an edge-ordered graph
- Altitude of 4-regular circulants
- Altitude of regular graphs with girth at least five
- Altitude of wheels and wheel-like graphs
- Finding monotone paths in edge-ordered graphs
- Increasing paths in edge ordered graphs
- Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs
- Large monotone paths in graphs with bounded degree
- Monotone paths in edge-ordered sparse graphs
- Some Combinatorial Theorems on Monotonicity
- The depression of a graph
- The depression of a graph and the diameter of its line graph
- Trees with depression three
This page was built for publication: The depression of a graph and \(k\)-kernels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2450123)