Factors with red-blue coloring of claw-free graphs and cubic graphs

DOI10.1007/s00373-023-02680-6zbMath1529.05129MaRDI QIDQ6166670

Michitaka Furuya, Mikio Kano

Publication date: 3 August 2023

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

zbMATH Keywords

Claw-free graphsvertex Ramsey type problems

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (1)

Degree factors with red-blue coloring of regular graphs

Cites Work

• Factors and factorizations of graphs. Proof techniques in factor theory
• Sufficient conditions for graphs to have \((g,f)\)-factors
• Characterization of 1-tough graphs using factors
• DisjointT-paths in tough graphs
• A remark on the factor theorems of lovász and tutte
• Graphs with 1-Factors
• The Subgraph Problem
• The factorization of graphs. II

This page was built for publication: Factors with red-blue coloring of claw-free graphs and cubic graphs