Publication:837164

DOI10.1016/J.TCS.2009.05.005zbMATH Open1171.68031OpenAlexW2068633285WikidataQ56390683 ScholiaQ56390683MaRDI QIDQ837164FDOQ837164

Łukasz Kowalik

Publication date: 10 September 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.05.005

zbMATH Keywords

algorithmedge-coloringmeasure and conquerexponential-time

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• The NP-Completeness of Edge-Coloring
• 3-coloring in time
• Automata, Languages and Programming
• Computer science today. Recent trends and developments
• Pathwidth of cubic graphs and exact algorithms
• A note on the complexity of the chromatic number problem
• Measure and conquer
• Snarks and reducibility
• A survey on snarks and new results: Products, reducibility and a computer search
• Algorithms and Data Structures
• A fast parallel algorithm for routing in permutation networks
• Applications of matching and edge‐coloring algorithms to routing in clos networks

Cited In (8)

• Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds
• Colorings with few colors: counting, enumeration and combinatorial bounds
• ON 4-EDGE COLORING OF CUBIC GRAPHS CONTAINING “SMALL” NON-PLANAR SUBGRAPHS
• Enumerating the edge-colourings and total colourings of a regular graph
• Switching 3-edge-colorings of cubic graphs
• Solving Matching Problems Efficiently in Bipartite Graphs
• Determining chromatic index of cubic graph with the use of explainable classifiers: a comparative study
• Interpretable random forest model for identification of edge 3-uncolorable cubic graphs

This page was built for publication: Improved edge-coloring with three colors

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