Scientific Research An Academic Publisher
OPEN ACCESS
Add your e-mail address to receive free newsletters from SCIRP.
Select Journal AA AAD AAR AASoci AAST ABB ABC ABCR ACES ACS ACT AD ADR AE AER AHS AID AiM AIT AJAC AJC AJCC AJCM AJIBM AJMB AJOR AJPS ALAMT ALC ALS AM AMI AMPC ANP APD APE APM ARS ARSci AS ASM BLR CC CE CellBio ChnStd CM CMB CN CRCM CS CSTA CUS CWEEE Detection EMAE ENG EPE ETSN FMAR FNS GEP GIS GM Graphene GSC Health IB ICA IIM IJAA IJAMSC IJCCE IJCM IJCNS IJG IJIDS IJIS IJMNTA IJMPCERO IJNM IJOC IJOHNS InfraMatics JACEN JAMP JASMI JBBS JBCPR JBiSE JBM JBNB JBPC JCC JCDSA JCPT JCT JDAIP JDM JEAS JECTC JEMAA JEP JFCMV JFRM JGIS JHEPGC JHRSS JIBTVA JILSA JIS JMF JMGBND JMMCE JMP JPEE JQIS JSBS JSEA JSEMAT JSIP JSS JSSM JST JTR JTST JTTs JWARP LCE MC ME MI MME MNSMS MPS MR MRC MRI MSA MSCE NJGC NM NR NS OALib OALibJ ODEM OJA OJAB OJAcct OJAnes OJAP OJApo OJAppS OJAPr OJAS OJBD OJBIPHY OJBM OJC OJCB OJCD OJCE OJCM OJD OJDer OJDM OJE OJEE OJEM OJEMD OJEpi OJER OJF OJFD OJG OJGas OJGen OJI OJIC OJIM OJINM OJL OJM OJMC OJMetal OJMH OJMI OJMIP OJML OJMM OJMN OJMP OJMS OJMSi OJN OJNeph OJO OJOG OJOGas OJOp OJOph OJOPM OJOTS OJPathology OJPC OJPChem OJPed OJPM OJPP OJPS OJPsych OJRA OJRad OJRD OJRM OJS OJSS OJSST OJST OJSTA OJTR OJTS OJU OJVM OPJ POS PP PST PSYCH SAR SCD SGRE SM SN SNL Soft SS TEL TI UOAJ VP WET WJA WJCD WJCMP WJCS WJET WJM WJNS WJNSE WJNST WJV WSN YM
More>>
T. Iida and T. Nishimura, “An Ore-Type Conditions for the Existence of k-Factors in Graphs,” Graphs and Combinatorics, Vol. 7, No. 4, 1991, pp. 353-361. http://dx.doi.org/10.1007/BF01787640
has been cited by the following article:
TITLE: A Neighborhood Condition for Graphs to Have Special [a,b]-Factor
AUTHORS: Jinguo Lei, Qingzhi Yu, Changhua Huang, Man Liu
KEYWORDS: Graph; Factor; [a, b]-Factor; The Minimum Degree; Neighborhood Condition
JOURNAL NAME: Applied Mathematics, Vol.5 No.1, January 16, 2014
ABSTRACT: Let G be a graph of order n, and let a and b be integers, such that 1 ≤ a b. Let H be a subgraph of G with m(≤b) edges, and δ(G) be the minimum degree. We prove that G has a [a,b]-factor containing all edges of H if , , and when a ≤ 2, .
Related Articles:
Graphs with Pendant Vertices and r(G) ≤ 7
Haicheng Ma, Shang Gao, Danyang Li
DOI: 10.4236/jamp.2020.82019 203 Downloads 315 Views Citations
Pub. Date: January 21, 2020
Non-Singular Trees, Unicyclic Graphs and Bicyclic Graphs
Haicheng Ma, Danyang Li, Chengling Xie
DOI: 10.4236/am.2020.111001 284 Downloads 467 Views Citations
Pub. Date: December 31, 2019
Erratum to “Simple Method for Evaluating Singular Integrals” [American Journal of Computational Mathematics, Volume 7, Number 4, December 2017 PP. 444-450]
Nhan T. Tran
DOI: 10.4236/ajcm.2019.93015 377 Downloads 668 Views Citations
Pub. Date: September 27, 2019
Testing Some f(R,T) Gravity Models from Energy Conditions
Flavio Gimenes Alvarenga, Mahouton Jonas Stephane Houndjo, Adjimon Vincent Monwanou, Jean Bio Chabi Orou
DOI: 10.4236/jmp.2013.41019 4,439 Downloads 6,995 Views Citations
Pub. Date: January 28, 2013
Further Properties of Reproducing Graphs
Jonathan Jordan, Richard Southwell
DOI: 10.4236/am.2010.15045 5,450 Downloads 8,827 Views Citations
Pub. Date: November 30, 2010
