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

DOI10.1007/S10114-014-3145-0zbMATH Open1288.05106OpenAlexW2068661660MaRDI QIDQ2452406FDOQ2452406

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Heterochromatic matchings in edge-colored graphs
• Graph theory with applications
• The NP-Completeness of Edge-Coloring
• Color degree and heterochromatic cycles in edge-colored graphs
• Rainbow matchings in properly edge colored graphs
• Equitable edge-colorings of simple graphs
• A generalization of edge-coloring in graphs
• Title not available (Why is that?)
• Color degree and alternating cycles in edge-colored graphs
• \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs
• Some results about f‐critical graphs
• \(f\)-colorings of some graphs of \(f\)-class 1
• Some sufficient conditions for a graph to be of \(C_f\) 1
• Some graphs of class 1 for \(f\)-colorings
• The classification of complete graphs \(K_n\) on \(f\)-coloring
• Title not available (Why is that?)
• A new sufficient condition for graphs of \(f\)-class 1.

Cited In (7)

• 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
• Some results on the \(f\)-chromatic index of graphs whose \(f\)-core has maximum degree 2

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)