Complexity of vertex switching on edge-bicolored graphs

DOI10.1007/978-3-030-17402-6_28OpenAlexW2945207199MaRDI QIDQ2294065FDOQ2294065

Authors: Ho Lam Pang, Leizhen Cai 

Publication date: 6 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-17402-6_28

Recommendations

• scientific article; zbMATH DE number 17815
• Publication:4502805
• On the complexity of vertex-coloring edge-weightings
• Complexity of edge coloring with minimum reload/changeover costs
• Complexity of hypergraph coloring and Seidel's switching.
• Edge-switching homomorphisms of edge-coloured graphs
• On the hardness of switching to a small number of edges
• The complexity of an exotic edge coloring of graphs
• On the complexity of bicoloring clique hypergraphs of graphs
• Two complexity results for the vertex coloring problem

zbMATH Keywords

graph algorithmsvertex switchingedge-bicolored graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited In (1)

• Biclique-colouring verification complexity and biclique-colouring power graphs

This page was built for publication: Complexity of vertex switching on edge-bicolored graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294065)