Some results on the f-chromatic index of graphs whose f-core has maximum degree 2
From MaRDI portal
Publication:5206907
Recommendations
Cites work
- scientific article; zbMATH DE number 3266380 (Why is no real title available?)
- A generalization of edge-coloring in graphs
- Some criteria for a graph to be class 1
- Some graphs of class 1 for \(f\)-colorings
- Some results about f‐critical graphs
- Some sufficient conditions for a graph to be of \(C_f\) 1
- The \(f\)-chromatic index of a graph whose \(f\)-core has maximum degree 2
- The chromatic index of a graph whose core has maximum degree two
- \(f\)-class two graphs whose \(f\)-cores have maximum degree two
Cited in
(9)- The \(f\)-chromatic index of a graph whose \(f\)-core has maximum degree 2
- \(f\)-colorings of some graphs of \(f\)-class 1
- On \(f\)-colorings of nearly bipartite graphs
- On color frames of claws and matchings
- Some graphs of class 1 for \(f\)-colorings
- On color frames of claws in graphs
- The correlation between the \(f\)-chromatic class and the \(g_c\)-chromatic class of a simple graph.
- \(f\)-class two graphs whose \(f\)-cores have maximum degree two
- The correlation between the \(f\)-chromatic class and the \(g_c\)-chromatic class of an \((r,r+1)\)-graph.
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)
