f-class two graphs whose f-cores have maximum degree two

DOI10.1007/S10114-014-3145-0MaRDI QIDQ2452406zbMATH OpenOpenAlexFDO

Authors Xia Zhang, Guiying Yan, Jiansheng Cai

Publication date 3 June 2014

Published in Acta Mathematica Sinica, English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10114-014-3145-0

zbMATH Keywords

simple graph\(f\)-chromatic index\(f\)-coloring\(f\)-class 2

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the size of graphs of class 2 whose cores have maximum degree two
• Some results on the \(f\)-chromatic index of graphs whose \(f\)-core has maximum degree 2
• The \(f\)-chromatic index of a graph whose \(f\)-core has maximum degree 2
• scientific article; zbMATH DE number 927053
• scientific article; zbMATH DE number 1334614
• Cores of class II graphs
• A Sufficient Condition for a Graph to be the Core of a Class 2 Graph
• The classification of \(f\)-coloring of graphs with large maximum degree
• The maximum corank of graphs with a 2-separation

Cites work

• scientific article; zbMATH DE number 5844210 (Why is no real title available?)
• scientific article; zbMATH DE number 927053 (Why is no real title available?)
• A generalization of edge-coloring in graphs
• A new sufficient condition for graphs of \(f\)-class 1.
• Color degree and alternating cycles in edge-colored graphs
• Color degree and heterochromatic cycles in edge-colored graphs
• Equitable edge-colorings of simple graphs
• Graph theory with applications
• Heterochromatic matchings in edge-colored graphs
• Rainbow matchings in properly edge colored graphs
• 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 NP-Completeness of Edge-Coloring
• The classification of complete graphs \(K_n\) on \(f\)-coloring
• \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs
• f-colorings of some graphs of f-class 1

Cited in

(7)

• Some results on the \(f\)-chromatic index of graphs whose \(f\)-core has maximum degree 2
• Graphs of \(f\)-class 1
• The \(f\)-chromatic index of a graph whose \(f\)-core has maximum degree 2
• The correlation between the \(f\)-chromatic class and the \(g_c\)-chromatic class of a simple graph.
• \(t\)-cores for \((\Delta + t )\)-edge-coloring
• On \(f\)-colorings of nearly bipartite graphs
• The classification of \(f\)-coloring of graphs with large maximum degree

This page was built for publication: \(f\)-class two graphs whose \(f\)-cores have maximum degree two

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