Subtree and substar intersection numbers

DOI10.1016/0166-218X(93)90232-DzbMath0782.05045OpenAlexW1969478787MaRDI QIDQ686262

Douglas B. West, Yi-Wu Chang, Michael S. Jacobson, 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

zbMATH Keywords

intersection numbersboundscliqueinterval numberstree numberstar number

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items (3)

Well-partitioned chordal graphs ⋮ A characterization of substar graphs ⋮ Interval numbers of powers of block graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The interval number of a planar graph: Three intervals suffice
• The edge intersection graphs of paths in a tree
• Edge and vertex intersection of paths in a tree
• A short proof of the degree bound for interval number
• On dimensional properties of graphs
• Extremal values of the interval number of a graph. II
• A recognition algorithm for the intersection graphs of paths in trees
• On the interval number of a chordal graph
• An improved edge bound on the interval number of a graph
• Extremal Values of the Interval Number of a Graph
• When the cartesian product of directed cycles is Hamiltonian
• Minimum partition of a matroid into independent subsets
• Decomposition of Finite Graphs Into Forests

This page was built for publication: Subtree and substar intersection numbers