Onk-leaf connectivity of a random graph

DOI10.1002/JGT.3190120102MaRDI QIDQ3807246zbMATH OpenOpenAlexFDO

Authors Tomasz Łuczak

Publication date 1988

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190120102

zbMATH Keywords

leaf connectivityrandom graph

Mathematics Subject Classification ID

Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• On k-leaf-connected graphs
• An improvement of sufficient condition for k-leaf-connected graphs
• A Fan-type condition for graphs to be \(k\)-leaf-connected
• Improved sufficient conditions for \(k\)-leaf-connected graphs
• \(k\)-connectivity in random graphs

Cited in

(8)

• k-connectivity in random undirected graphs
• On k-leaf-connected graphs
• Partitioning random graphs into large cycles
• Cycles in random graphs
• A Fan-type condition for graphs to be \(k\)-leaf-connected
• An improvement of sufficient condition for k-leaf-connected graphs
• Connectivity and Diagnosability of Leaf-Sort Graphs
• Results on k-leaf-connected graphs and digraphs: a survey

This page was built for publication: Onk-leaf connectivity of a random graph

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