On a problem concerning ordered colourings

DOI10.1016/S0012-365X(98)00149-6MaRDI QIDQ1584394zbMATH OpenFDO

Authors Louis Caccetta, Rui Zhong Jia

Publication date 2 November 2000

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

connected graphcritical graphindependence number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Recommendations

• A note on Vizing's independence number conjecture of edge chromatic critical graphs
• Bounds for the Independence Number of Critical Graphs
• An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs
• On the independence number of edge chromatic critical graphs.
• A new upper bound for the independence number of edge chromatic critical graphs

Cites work

• Graph theory
• Matching theory
• Ordered colourings

Cited in

(9)

• Fibres and ordered set coloring
• On first-order definable colorings
• Coloring Ordered Sets to Avoid Monochromatic Maximal Chains
• scientific article; zbMATH DE number 6518587 (Why is no real title available?)
• scientific article; zbMATH DE number 2060071 (Why is no real title available?)
• scientific article; zbMATH DE number 4122024 (Why is no real title available?)
• Independent coverings and orthogonal colourings
• Bounds and monotonicity of critical set parameters of colourings
• Coloring linear orders with Rado's partial order

This page was built for publication: On a problem concerning ordered colourings

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