Interpretable random forest model for identification of edge 3-uncolorable cubic graphs

DOI10.14736/kyb-2023-6-0807OpenAlexW4391575455MaRDI QIDQ6125138

Unnamed Author, Unnamed Author

Publication date: 11 April 2024

Published in: Kybernetika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14736/kyb-2023-6-0807

zbMATH Keywords

snarkrandom forestproper edge coloringinterpretable machine learning

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Improved edge-coloring with three colors
• Remarks on proper conflict-free colorings of graphs
• House of graphs 2.0: a database of interesting graphs and more
• Connectivity and eigenvalues of graphs with given girth or clique number
• Sharp spectral bounds for the edge-connectivity of regular graphs
• Fast approximation algorithms for the diameter and radius of sparse graphs

This page was built for publication: Interpretable random forest model for identification of edge 3-uncolorable cubic graphs