Degree sums and graphs that are not covered by two cycles

DOI<51::AID-JGT5>3.0.CO;2-L 10.1002/(SICI)1097-0118(199909)32:1<51::AID-JGT5>3.0.CO;2-LzbMath0931.05070OpenAlexW4251009606MaRDI QIDQ4265587

Akira Saito

Publication date: 22 September 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199909)32:1<51::aid-jgt5>3.0.co;2-l

zbMATH Keywords

degree sumcycle covering

Mathematics Subject Classification ID

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

Related Items

A degree sum condition for graphs to be covered by two cycles