Subtree and substar intersection numbers
From MaRDI portal
Publication:686262
DOI10.1016/0166-218X(93)90232-DzbMATH Open0782.05045OpenAlexW1969478787MaRDI QIDQ686262FDOQ686262
Douglas B. West, Michael Jacobson, Yi-Wu Chang, Clyde l. Monma
Publication date: 24 February 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(93)90232-d
Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Edge and vertex intersection of paths in a tree
- Decomposition of Finite Graphs Into Forests
- The edge intersection graphs of paths in a tree
- Minimum partition of a matroid into independent subsets
- A recognition algorithm for the intersection graphs of paths in trees
- On dimensional properties of graphs
- Extremal Values of the Interval Number of a Graph
- The interval number of a planar graph: Three intervals suffice
- Title not available (Why is that?)
- A short proof of the degree bound for interval number
- Extremal values of the interval number of a graph. II
- On the interval number of a chordal graph
- An improved edge bound on the interval number of a graph
- When the cartesian product of directed cycles is Hamiltonian
Cited In (4)
Recommendations
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)