Undirected graphs rearrangeable by 2-length walks

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199807)31:4<239::AID-NET4>3.0.CO;2-E" /><239::AID-NET4>3.0.CO;2-E 10.1002/(SICI)1097-0037(199807)31:4<239::AID-NET4>3.0.CO;2-EzbMath0990.05108OpenAlexW1977690102MaRDI QIDQ4540050

Petrişor Panaite, Dominique Barith

Publication date: 21 July 2002

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199807)31:4<239::aid-net4>3.0.co;2-e

zbMATH Keywords

2-rearrangeable graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

This page was built for publication: Undirected graphs rearrangeable by 2-length walks