Bounded degrees and prescribed distances in graphs

DOI10.1016/0012-365X(93)90144-IzbMATH Open0786.05030OpenAlexW2044686427MaRDI QIDQ686447FDOQ686447

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

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

zbMATH Keywords

boundmaximum degreeantipodal set-pairprescribed distances

Mathematics Subject Classification ID

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

Cites Work

• On generalized graphs
• An extremal problem for two families of sets
• Intersection patterns of convex sets
• Critical hypergraphs and interesting set-pair systems
• Minimum number of elements of representing a set system of given rank
• Title not available (Why is that?)
• Hypergraph coverings and local colorings
• Inequalities for two set systems with prescribed intersections
• Title not available (Why is that?)

Cited In (2)

• Bounded-degree graphs can have arbitrarily large slope numbers
• Title not available (Why is that?)

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)