A Neighborhood Condition for Graphs to Have [a, b]-Factors III

DOI10.1007/978-3-540-70666-3_8MaRDI QIDQ3595441zbMATH OpenOpenAlexFDO

Authors Haruhide Matsuda, Mikio Kano

Publication date 28 August 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70666-3_8

Mathematics Subject Classification ID

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

Recommendations

• A neighborhood condition for graphs to have \([a, b]\)-factors. II
• scientific article; zbMATH DE number 1501177
• On neighborhood condition for graphs to have [\(a\), \(b\)]-factors
• A neighborhood condition for graphs to have \([a,b]\)-factors excluding a given subgraph
• scientific article; zbMATH DE number 1910915

Cited in

(7)

• A neighborhood condition for graphs to have \([a,b]\)-factors excluding a given subgraph
• A neighbourhood condition for graphs to have \([a,b]\)-factors
• Sufficient conditions for a graph to have all \([a, b]\)-factors and \((a, b)\)-parity factors
• Binding numbers of graphs and the existence of \([a,b]\)-factors
• A neighborhood condition for graphs to have \([a, b]\)-factors. II
• scientific article; zbMATH DE number 1910915 (Why is no real title available?)
• On neighborhood condition for graphs to have [\(a\), \(b\)]-factors

This page was built for publication: A Neighborhood Condition for Graphs to Have [a, b]-Factors III

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