论文信息 - Complexity of Vertex Switching on Edge-Bicolored Graphs

Complexity of Vertex Switching on Edge-Bicolored Graphs

An edge-bicolored graph is an undirected graph where each edge is colored exclusively either blue or red. We consider the following switching operation at vertices of edge-bicolored graphs: switching at a vertex changes colors of all edges incident with the vertex from blue to red and vice versa.

Leizhen Cai | Ho Lam Pang

[1] Alon Itai,et al. On the complexity of time table and multi-commodity flow problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[2] Alon Itai,et al. On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[3] R. Abelson,et al. Symbolic psycho‐logic: A model of attitudinal cognition , 2007 .

[4] Peter Winkler,et al. Universal configurations in light-flipping games , 2001, SODA '01.

[5] Tero Harju,et al. Complexity Issues in Switching of Graphs , 1998, TAGT.

[6] Tero Harju,et al. Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes , 2003, Fundam. Informaticae.

[7] Jan Kratochvíl,et al. On the Computational Complexity of Seidel's Switching , 1992 .

[8] Jan Kratochvíl,et al. Complexity of Hypergraph Coloring and Seidel's Switching , 2003, WG.

[9] T. Zaslavsky. A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas , 2018, The Electronic Journal of Combinatorics.

[10] Klaus Jansen,et al. Graph Subcolorings: Complexity and Algorithms , 2003 .

[11] J. J. Seidel,et al. A SURVEY OF TWO-GRAPHS , 1976 .