scientific article; zbMATH DE number 7145383

zbMath1472.05047MaRDI QIDQ5206907

M. Chavooshi, Saieed Akbari, Maryam Ghanbari, R. Manaviyat

Publication date: 19 December 2019

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/75/ajc_v75_p032.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

\(f\)-chromatic indexconnected claw-free graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (1)

On \(f\)-colorings of nearly bipartite graphs

Cites Work

• Unnamed Item
• Some criteria for a graph to be class 1
• Some sufficient conditions for a graph to be of \(C_f\) 1
• The chromatic index of a graph whose core has maximum degree two
• \(f\)-class two graphs whose \(f\)-cores have maximum degree two
• Some graphs of class 1 for \(f\)-colorings
• The f-Chromatic Index of a Graph Whose f-Core Has Maximum Degree 2
• A generalization of edge-coloring in graphs
• Some results about f‐critical graphs

This page was built for publication: