Interpolation theorem for a continuous function on orientations of a simple graph

DOI10.1023/A:1022471626622zbMath0949.05034OpenAlexW109020953MaRDI QIDQ4515315

Zhibo Chen, Fu Ji Zhang

Publication date: 13 November 2000

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/30431

zbMATH Keywords

connectivityarboricityinterpolation propertyorientation of a graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A solution of Chartrand's problem on spanning trees
• Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size
• A lower bound on solutions of Chartrand's problem
• Distances in orientations of graphs
• On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets
• An orientation theorem for graphs
• Matroid tree graphs and interpolation theorems
• Acyclic orientations of graphs
• Interpolation theorem for diameters of spanning trees
• Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
• On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
• On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
• Interpolation theorem for the number of end‐vertices of spanning trees
• On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets
• On the Structure of the Strong Orientations of a Graph
• A Theorem on Graphs, with an Application to a Problem of Traffic Control