Enumeration algorithm for the edge coloring problem on bipartite graphs

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

Tomomi Matsui, Yasuko Matsui

Publication date: 5 July 2024

zbMATH Keywords

number of edge coloringstime complexity of an edge coloring algorithm

Mathematics Subject Classification ID

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

Cites Work

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

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)