Graphs with small fall-spectrum

DOI10.1016/J.DAM.2018.06.037zbMath1404.05064OpenAlexW2885572072WikidataQ129368222 ScholiaQ129368222MaRDI QIDQ1720325

Xianqiang Yang

Publication date: 8 February 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.06.037

zbMATH Keywords

bipartite fall-perfect graphsfall-coloringfall-perfect graphsfall-spectrum

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)

Related Items (1)

Well-partitioned chordal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An introduction to timetabling
• Fall colouring of bipartite graphs and Cartesian products of graphs
• The b-chromatic number of a graph
• \(b\)-coloring of tight graphs
• Linear time optimization algorithms for \(P_ 4\)-sparse graphs
• The \(b\)-chromatic index of graphs
• On Fall Colorings of Graphs
• A Characterization of b-Perfect Graphs
• Fall coloring of graphs I
• The NP-Completeness of Edge-Coloring

This page was built for publication: Graphs with small fall-spectrum