KEdgeConnectedGraphQ[g,k]
yields True if the graph g is k-edge-connected and False otherwise.


KEdgeConnectedGraphQ
KEdgeConnectedGraphQ[g,k]
yields True if the graph g is k-edge-connected and False otherwise.
Examples
open all close allBasic Examples (2)
Scope (5)
KEdgeConnectedGraphQ gives False for anything that is not a k-connected graph:
Related Guides
History
Text
Wolfram Research (2014), KEdgeConnectedGraphQ, Wolfram Language function, https://reference.wolfram.com/language/ref/KEdgeConnectedGraphQ.html.
CMS
Wolfram Language. 2014. "KEdgeConnectedGraphQ." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/KEdgeConnectedGraphQ.html.
APA
Wolfram Language. (2014). KEdgeConnectedGraphQ. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/KEdgeConnectedGraphQ.html
BibTeX
@misc{reference.wolfram_2025_kedgeconnectedgraphq, author="Wolfram Research", title="{KEdgeConnectedGraphQ}", year="2014", howpublished="\url{https://reference.wolfram.com/language/ref/KEdgeConnectedGraphQ.html}", note=[Accessed: 16-August-2025]}
BibLaTeX
@online{reference.wolfram_2025_kedgeconnectedgraphq, organization={Wolfram Research}, title={KEdgeConnectedGraphQ}, year={2014}, url={https://reference.wolfram.com/language/ref/KEdgeConnectedGraphQ.html}, note=[Accessed: 16-August-2025]}