Chromatic index of finite and infinite graphs

1972/01/01 by Juraj Bosák · 1 citation
Mathematics · Computer Science · #Graph theory and applications #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Mathematics #Chromatic scale #Index (typography) #Ordinary differential equation #Combinatorics #Mathematical analysis #Differential equation #Computer science

paper · pdf · doi:10.21136/cmj.1972.101098

openalex publication_date 1972/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/23

Abstract

In this paper we consider only nonoriented graphs without loops, finite or infinite; multiple edges are admissible. As a rule, we do not distinguish between isomorphic graphs.

Citations

• A Colour Problem for Infinite Graphs and a Problem in the Theory of Relations
• A Theorem on Coloring the Lines of a Network

Cited by

• Edge coloring [wikipedia]