Subdivisions, parity and well-covered graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199705)25:1<85::AID-JGT6>3.0.CO;2-E" /><85::AID-JGT6>3.0.CO;2-E 10.1002/(SICI)1097-0118(199705)25:1<85::AID-JGT6>3.0.CO;2-EzbMath0873.05053OpenAlexW2073099254MaRDI QIDQ4337508

Yair Caro

Publication date: 26 October 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199705)25:1<85::aid-jgt6>3.0.co;2-e

zbMATH Keywords

complexitywell-covered graphparity graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Recognizing well covered graphs of families with special \(P _{4}\)-components ⋮ A characterization of Zm-well-covered graphs of girth 6 or more

This page was built for publication: Subdivisions, parity and well-covered graphs