Complexity of vertex switching on edge-bicolored graphs

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

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

zbMATH Keywords

graph algorithmsvertex switchingedge-bicolored graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Biclique-colouring verification complexity and biclique-colouring power graphs

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Two complexity results for the vertex coloring problem 👍 👎
• Edge-switching homomorphisms of edge-coloured graphs 👍 👎
• On the Hardness of Switching to a Small Number of Edges 👍 👎
• On the complexity of bicoloring clique hypergraphs of graphs 👍 👎
• Complexity of edge coloring with minimum reload/changeover costs 👍 👎
• Graph-Theoretic Concepts in Computer Science 👍 👎

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)