Enumeration algorithm for the edge coloring problem on bipartite graphs

DOI10.1007/3-540-61576-8_69zbMATH Open1543.05086MaRDI QIDQ6567666FDOQ6567666

Authors: Yasuko Matsui, Tomomi Matsui 

Publication date: 5 July 2024

zbMATH Keywords

number of edge coloringstime complexity of an edge coloring algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30)

Cites Work

• Depth-First Search and Linear Graph Algorithms
• Finding all the perfect matchings in bipartite graphs
• Graph theory with applications
• Finding all minimum-cost perfect matchings in Bipartite graphs
• Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
• Open Shop Scheduling to Minimize Finish Time
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• Uniquely Line Colorable Graphs
• On Edge Coloring Bipartite Graphs
• Using euler partitions to edge color bipartite multigraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre.

This page was built for publication: Enumeration algorithm for the edge coloring problem on bipartite graphs

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