Some results on the f-chromatic index of graphs whose f-core has maximum degree 2

zbMATH Open1472.05047MaRDI QIDQ5206907FDOQ5206907

Authors: S. Akbari, M. Chavooshi, M. 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

Recommendations

• The \(f\)-chromatic index of a graph whose \(f\)-core has maximum degree 2
• Some graphs of class 1 for \(f\)-colorings
• \(f\)-colorings of some graphs of \(f\)-class 1
• Graphs of \(f\)-class 1
• \(f\)-class two graphs whose \(f\)-cores have maximum degree two

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• A generalization of edge-coloring in graphs
• The chromatic index of a graph whose core has maximum degree two
• Some criteria for a graph to be class 1
• Some results about f‐critical graphs
• Title not available (Why is that?)
• Some sufficient conditions for a graph to be of \(C_f\) 1
• Some graphs of class 1 for \(f\)-colorings
• \(f\)-class two graphs whose \(f\)-cores have maximum degree two
• The \(f\)-chromatic index of a graph whose \(f\)-core has maximum degree 2

Cited In (5)

• Some graphs of class 1 for \(f\)-colorings
• \(f\)-class two graphs whose \(f\)-cores have maximum degree two
• On \(f\)-colorings of nearly bipartite graphs
• \(f\)-colorings of some graphs of \(f\)-class 1
• On color frames of claws in graphs

This page was built for publication: Some results on the \(f\)-chromatic index of graphs whose \(f\)-core has maximum degree 2

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