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

DOI10.1016/j.ipl.2018.02.004zbMath1476.05062OpenAlexW2790925832MaRDI QIDQ1707984

Xia Zhang, Yu-Zhuo Zhang

Publication date: 4 April 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.02.004

zbMATH Keywords

edge coloringgraph algorithmsnearly bipartite graph\(f\)-chromatic index\(f\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some sufficient conditions for a graph to be of \(C_f\) 1
• \(f\)-colorings of some graphs of \(f\)-class 1
• The classification of \(f\)-coloring of graphs with large maximum degree
• Graphs of \(f\)-class 1
• \(f\)-class two graphs whose \(f\)-cores have maximum degree two
• Some graphs of class 1 for \(f\)-colorings
• The classification of complete graphs \(K_n\) on \(f\)-coloring
• The f-Chromatic Index of a Graph Whose f-Core Has Maximum Degree 2
• A generalization of edge-coloring in graphs
• Scheduling File Transfers
• Scheduling File Transfers for Trees and Odd Cycles
• On the f-coloring of multigraphs
• The NP-Completeness of Edge-Coloring
• Some results about f‐critical graphs

This page was built for publication: On \(f\)-colorings of nearly bipartite graphs