A New Sufficient Condition for a Graph To Be (g, f, n)-Critical

DOI10.4153/CMB-2010-034-8zbMATH Open1192.05126OpenAlexW1990117560MaRDI QIDQ3569399

Sizhong Zhou

Publication date: 21 June 2010

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cmb-2010-034-8

zbMATH Keywords

graph\((g, f)\)-factorbinding number\((g, f, n)\)-critical graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Title not available (Why is that?) ⋮ Title not available (Why is that?)

This page was built for publication: A New Sufficient Condition for a Graph To Be (g, f, n)-Critical

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