About weak connectivity

DOI10.1016/S0012-365X(96)00203-8MaRDI QIDQ1356780zbMATH OpenOpenAlexWikidataFDO

Authors Pascal Préa

Publication date 26 October 1997

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(96)00203-8

zbMATH Keywords

digraphsconnectivitytournamentweakly connected components

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Recommendations

• Cycle factors in strongly connected local tournaments
• Completely strong path-connectivity of local tournaments
• scientific article; zbMATH DE number 1287859
• Weakly Hamiltonian-connected locally semicomplete digraphs

Cites work

• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• Graphs and topologies on discrete sets
• Locally semicomplete digraphs: A generalization of tournaments

Cited in

(3)

• The competition graph of a connected nonstrong local tournament
• Preference graph of potential method as a fuzzy graph
• Connectivity of local tournaments

This page was built for publication: About weak connectivity

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