On an estimate of the chromatic class of a \(p\)-graph
From MaRDI portal
Publication:6539514
zbMath1539.05042MaRDI QIDQ6539514
Publication date: 14 May 2024
Published in: Diskretnyĭ Analiz (Search for Journal in Brave)
Related Items (30)
Kempe changes in degenerate graphs ⋮ Strongly proper connected coloring of graphs ⋮ Maximal colourings for graphs ⋮ On the chromatic number of powers of subdivisions of graphs ⋮ Diverse pairs of matchings ⋮ The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark ⋮ On the total chromatic number of the direct product of cycles and complete graphs ⋮ Fractal networks: topology, dimension, and complexity ⋮ Color trades on \(n\)-cubes and complete bipartite graphs ⋮ Planar graphs are acyclically edge \((\Delta + 5)\)-colorable ⋮ Kempe classes and almost bipartite graphs ⋮ An improved upper bound on the edge-face coloring of 2-connected plane graphs ⋮ Precoloring extension of Vizing's theorem for multigraphs ⋮ Graphs, disjoint matchings and some inequalities ⋮ Fractional coloring with local demands and applications to degree-sequence bounds on the independence number ⋮ The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability ⋮ A note on the immersion number of generalized Mycielski graphs ⋮ Edge-coloring of plane graphs with many colors on faces ⋮ On the chromatic index of complementary prisms ⋮ The proper 2-connection number of several graph classes ⋮ A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs ⋮ Geometric property (T) and Kazhdan projections ⋮ The edge coloring of the Cartesian product of signed graphs ⋮ The chromaticity of complete split graphs ⋮ New results on edge-coloring and total-coloring of split graphs ⋮ Borel Vizing's theorem for graphs of subexponential growth ⋮ Parameterized results on acyclic matchings with implications for related problems ⋮ Local version of Vizing's theorem for multigraphs ⋮ Sufficient conditions make graphs edge DP-\(\varDelta\)-colorable ⋮ Determining chromatic index of cubic graph with the use of explainable classifiers: a comparative study
This page was built for publication: On an estimate of the chromatic class of a \(p\)-graph
