On the connection between the chromatic number of a graph and the number of cycles covering a vertex or an edge

DOI10.1007/s10958-018-3853-6zbMath1393.05105OpenAlexW2803658110MaRDI QIDQ1661493

K. I. Tyschuk, S. L. Berlov

Publication date: 16 August 2018

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-018-3853-6

zbMATH Keywords

\(k\)-critical graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Some generalizations of theorems on vertex coloring
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Cycle lengths and chromatic number of graphs
• Colouring Graphs with Prescribed Induced Cycle Lengths
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

This page was built for publication: On the connection between the chromatic number of a graph and the number of cycles covering a vertex or an edge