The 2‐intersection number of paths and bounded‐degree trees

DOI10.1002/JGT.3190190403MaRDI QIDQ4842702zbMATH OpenOpenAlexFDO

Authors Michael Jacobson, André E. Kézdy, Douglas B. West

Publication date 16 August 1995

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190190403

zbMATH Keywords

asymptoticboundcycleintersection representationpathtree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• Onp-intersection representations
• scientific article; zbMATH DE number 2044920
• Intersection representation of complete unbalanced bipartite graphs
• The total interval number of a graph
• Intersection graphs of short paths in a tree

Cites work

• scientific article; zbMATH DE number 45817 (Why is no real title available?)
• The Representation of a Graph by Set Intersections

Cited in

(4)

• \(p\)-competition graphs
• scientific article; zbMATH DE number 5054175 (Why is no real title available?)
• Subtree and substar intersection numbers
• Forbidden induced subgraphs for bounded p-intersection number

This page was built for publication: The 2‐intersection number of paths and bounded‐degree trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4842702)