A neighborhood condition for graphs to have [a, b]-factors. II

DOI10.1007/S003730200062zbMATH Open1009.05111OpenAlexW2146986422MaRDI QIDQ1865629FDOQ1865629

Haruhide Matsuda

Publication date: 27 March 2003

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

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

Mathematics Subject Classification ID

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

Cited In (4)

• A neighborhood condition for graphs to have \([a,b]\)-factors excluding a given subgraph
• A neighbourhood condition for graphs to have \([a,b]\)-factors
• Graph factors and factorization: 1985--2003: a survey
• On neighborhood condition for graphs to have [\(a\), \(b\)]-factors

   Recommendations

• A Neighborhood Condition for Graphs to Have [a, b-Factors III] 👍 👎
• On neighborhood condition for graphs to have [\(a\), \(b\)-factors] 👍 👎
• 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. II

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