The edge-cochromatic number of bipartite graph

MaRDI QIDQ3610620zbMATH OpenFDO

Authors Haipeng Liang, Xinsheng Liu

Publication date 6 March 2009

zbMATH Keywords

complete bipartite graph\( k\)-regular bipartite graphcomplete \( k\)-partite graphThe edge-cochromatic number

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Edge-Coloring Bipartite Graphs
• Algorithms for edge coloring bipartite graphs
• Edge coloring nearly bipartite graphs
• Edge-coloring almost bipartite multigraphs
• On the edge colouring of bipartite graphs

Cited in

(2)

• Edge-Coloring Bipartite Graphs
• Algorithm for identifying \((2,2)\)-bipartite graphs

This page was built for publication: The edge-cochromatic number of bipartite graph

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