A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs

DOI10.1137/S0895480100381890zbMath1071.05063OpenAlexW2054840573MaRDI QIDQ4652628

Jurriaan Hage, Tero J.Harju

Publication date: 28 February 2005

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480100381890

zbMATH Keywords

Seidel switchingtreesacyclic graphcritically cyclic graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Signed and weighted graphs (05C22)

Related Items (2)

On Switching to H‐Free Graphs ⋮ GETGRATS

This page was built for publication: A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs