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

\((3, k)\)-factor-critical graphs and toughness

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

DOI10.1007/S003730050053zbMath0939.05069OpenAlexW2054167287MaRDI QIDQ1961763

Minyong Shi, Odile Favaron, Xu Dong Yuan, Mao-cheng Cai

Publication date: 5 July 2000

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730050053


zbMATH Keywords

toughnessfactor-critical


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)


Related Items (2)

Toughness in graphs -- a survey ⋮ Unnamed Item







This page was built for publication: \((3, k)\)-factor-critical graphs and toughness

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1961763&oldid=14401771"
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 16:33.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki