Prove or disprove!

Правка en1, от AlefHeKaaf, 2024-05-03 12:55:25

Is it possible to split (each vertex should be exactly in one subgraph) a connected graph with 2n vertices into two induced subgraphs (each subgraph must have at least one vertex) so that the degree of each vertex of each subgraph becomes even?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский AlefHeKaaf 2024-05-03 12:55:25 262 Initial revision (published)