Bounded degrees and prescribed distances in graphs

DOI10.1016/0012-365X(93)90144-IMaRDI QIDQ686447zbMATH OpenOpenAlexFDO

Authors Yair Caro, Zsolt Tuza

Publication date 5 May 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(93)90144-i

zbMATH Keywords

boundmaximum degreeantipodal set-pairprescribed distances

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Recommendations

• Bounds for degree distance of a graph
• Graphs whose vertices are graphs with bounded degree: Distance problems
• scientific article; zbMATH DE number 1618191
• The degree distance of certain particular graphs
• Graphs with bounded induced distance
• scientific article; zbMATH DE number 1262797
• Circumference of Graphs with Bounded Degree
• Some degree bounds for the circumference of graphs
• Bounds for distance domination numbers of graphs
• On the degree distance of a graph

Cites work

• scientific article; zbMATH DE number 3561367 (Why is no real title available?)
• scientific article; zbMATH DE number 4185671 (Why is no real title available?)
• An extremal problem for two families of sets
• Critical hypergraphs and interesting set-pair systems
• Hypergraph coverings and local colorings
• Inequalities for two set systems with prescribed intersections
• Intersection patterns of convex sets
• Minimum number of elements of representing a set system of given rank
• On generalized graphs

Cited in

(2)

• Bounded-degree graphs can have arbitrarily large slope numbers
• scientific article; zbMATH DE number 1262797 (Why is no real title available?)

This page was built for publication: Bounded degrees and prescribed distances in graphs

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