scientific article; zbMATH DE number 7804510

MaRDI QIDQ6153236

Oleg Duginov, Unnamed Author

Publication date: 13 February 2024

Full work available at URL: https://vestifm.belnauka.by/jour/article/view/640

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

zbMATH Keywords

treespartitioning the edge set of graphsubgraphs of simple cycle of order 4

Mathematics Subject Classification ID

Theory of computing (68Qxx) Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Covering the edges of bipartite graphs using \(K_{2,2}\) graphs
• On the complexity of partitioning graphs into connected subgraphs
• Recognition of perfect elimination bipartite graphs
• The NP-Completeness of Some Edge-Partition Problems
• Perfect Elimination and Chordal Bipartite Graphs
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture

This page was built for publication: