scientific article; zbMATH DE number 1504827

zbMath0958.68133MaRDI QIDQ4502805

Andrzej Ehrenfeucht, Jurriaan Hage, Grzegorz Rozenberg, Tero J.Harju

Publication date: 12 September 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

switchinggraph transformations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity ⋮ Subgraph complementation ⋮ Switching to Hedgehog-Free Graphs Is NP-Complete ⋮ GETGRATS ⋮ On the Hardness of Switching to a Small Number of Edges ⋮ Partial complementation of graphs

Cites Work

• Biased graphs. I: Bias, balance, and gains
• Pancyclicity and NP-completeness in planar graphs
• Pancyclic graphs. I
• Dynamic labeled 2-structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: