scientific article; zbMATH DE number 817188

MaRDI QIDQ4854623zbMATH OpenFDO

Authors Cornelius Croitoru, C.Radu

Publication date 20 February 1996

zbMATH Keywords

chromatic numbercolouringorderable graphsorderingsstable set

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 4134072
• A Question of Protocol
• Connected greedy colourings
• A Coloring Problem
• Four classes of perfectly orderable graphs

Cited in

(18)

• Connected sequential colourings
• Fibres and ordered set coloring
• A charming class of perfectly orderable graphs
• Sequential colorings and perfect graphs
• Greedy \(F\)-colorings of graphs
• Orderings on graphs and game coloring number
• Ordered colourings
• On properly ordered coloring of vertices in a vertex-weighted graph
• On the Complexity of Ordered Colorings
• scientific article; zbMATH DE number 4053647 (Why is no real title available?)
• scientific article; zbMATH DE number 1185595 (Why is no real title available?)
• scientific article; zbMATH DE number 1251573 (Why is no real title available?)
• A Question of Protocol
• scientific article; zbMATH DE number 1409182 (Why is no real title available?)
• scientific article; zbMATH DE number 7523847 (Why is no real title available?)
• Connected greedy colourings
• On vertex orderings and the stability number in triangle-free graphs
• Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly

This page was built for publication:

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