Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Discussiones Mathema...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Discussiones Mathematicae Graph Theory
Article . 1996 . Peer-reviewed
Data sources: Crossref
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
DBLP
Article . 2020
Data sources: DBLP
https://dx.doi.org/10.7151/dmg...
Article
Data sources: Microsoft Academic Graph
 View all 3 versions
Claim

On k-factor-critical graphs

On \(k\)-factor-critical graphs
descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 1996 English Publisher:University of Zielona Góra, PolandJournal:Discussiones Mathematicae Graph Theory, volume 16, page 41 (issn: 1234-3099, eissn: 2083-5892, Copyright policy )
Authors: Odile Favaron;

doi: 10.7151/dmgt.1022

On k-factor-critical graphs

Abstract

Summary: A graph is said to be \(k\)-factor-critical if the removal of any set of \(k\) vertices results in a graph with a perfect matching. We study some properties of \(k\)-factor-critical graphs and show that many results on \(q\)-extendable graphs can be improved using this concept.

Related Organizations
Keywords

factor, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), perfect matching, \(q\)-extendable graphs

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 60
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    		 Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 Top 1%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    		 Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
60
Top 10%
Top 1%
Average
Published in a Diamond OA journal