Subtree and substar intersection numbers
From MaRDI portal
Publication:686262
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3906537 (Why is no real title available?)
- A recognition algorithm for the intersection graphs of paths in trees
- A short proof of the degree bound for interval number
- An improved edge bound on the interval number of a graph
- Decomposition of Finite Graphs Into Forests
- Edge and vertex intersection of paths in a tree
- Extremal Values of the Interval Number of a Graph
- Extremal values of the interval number of a graph. II
- Minimum partition of a matroid into independent subsets
- On dimensional properties of graphs
- On the interval number of a chordal graph
- The edge intersection graphs of paths in a tree
- The interval number of a planar graph: Three intervals suffice
- When the cartesian product of directed cycles is Hamiltonian
Cited in
(5)
This page was built for publication: Subtree and substar intersection numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686262)