scientific article; zbMATH DE number 3572198

MaRDI QIDQ4143334zbMATH OpenFDO

Authors Michel Dalmazzo

Publication date 1977

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35)

Cited in

(9)

• Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
• Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)
• Spanning subgraphs of k-connected digraphs
• Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
• On minimally \((n,\lambda)\)-connected graphs
• Sparse highly connected spanning subgraphs in dense directed graphs
• On reversing arcs to improve arc-connectivity
• A max-min problem on spectral radius and connectedness of graphs
• Gale diagrams of convex polytopes and positive spanning sets of vectors

This page was built for publication:

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