A neighborhood condition for graphs to have \([a,b]\)-factors excluding a given subgraph

zbMATH Open1373.05153MaRDI QIDQ2811824

Sizhong Zhou

Publication date: 10 June 2016

Published in: Utilitas Mathematica (Search for Journal in Brave)

zbMATH Keywords

minimum degree conditionexcluded subgraph\([ab\)-factor]

Mathematics Subject Classification ID

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

Related Items (1)

On neighborhood condition for graphs to have [\(a\), \(b\)]-factors

Recommendations

• A sufficient condition for a graph to have \([a,b\)-factors] 👍 👎
• A neighbourhood condition for graphs to have \([a,b\)-factors] 👍 👎
• On neighborhood condition for graphs to have [\(a\), \(b\)-factors] 👍 👎
• A neighborhood condition for graphs to have \([a, b\)-factors. II] 👍 👎
• A Neighborhood Condition for Graphs to Have [a, b-Factors III] 👍 👎
• A neighborhood condition for graphs to have restricted fractional (g,f)-factors 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: A neighborhood condition for graphs to have \([a,b]\)-factors excluding a given subgraph

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