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-6zbMATH Open1393.05105OpenAlexW2803658110MaRDI QIDQ1661493FDOQ1661493

Authors: S. L. Berlov, K. I. Tyschuk 

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

Recommendations

• The chromatic covering number of a graph
• Covering the vertex set of a graph with subgraphs of smaller degree
• Cycle lengths and chromatic number of graphs
• Cycles and new bounds for the chromatic number
• Size, chromatic number, and connectivity

zbMATH Keywords

\(k\)-critical graph

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Covering the vertex set of a graph with subgraphs of smaller degree
• The chromatic covering number of a graph
• The chromatic numbers of double coverings of a graph
• Chromatic number, induced cycles, and non-separating cycles

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

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