Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Complexity results for the proper disconnection of graphs

From MaRDI portal
Publication:2037957
Jump to:navigation, search

DOI10.1007/978-3-030-59901-0_1OpenAlexW3090858862MaRDI QIDQ2037957

You Chen, Ping Li, Yin Di Weng, Xue Liang Li

Publication date: 8 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-59901-0_1


zbMATH Keywords

complexityedge-coloringNP-completeproper disconnection numberproper edge-cut


Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)


Related Items (4)

Upper bounds for the \(M D\)-numbers and characterization of extremal graphs ⋮ Complexity results for two kinds of colored disconnections of graphs ⋮ Proper disconnection of graphs ⋮ Further results on the rainbow vertex-disconnection of graphs







This page was built for publication: Complexity results for the proper disconnection of graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2037957&oldid=14508723"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 19:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki