scientific article; zbMATH DE number 1536522

MaRDI QIDQ4518396zbMATH OpenFDO

Authors Peter Mihók, Zsolt Tuza, Margit Voigt

Publication date 28 November 2000

zbMATH Keywords

choosabilityhypergraph colouringhereditary properties of graphs\(\mathcal P\)-choice ratiofractional \(\mathcal P\)-colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)

Recommendations

• Fractionally total colouring \(G_{n,p}\)
• Choosability and fractional chromatic numbers
• Fractional colouring and Hadwiger's conjecture
• Fractional \((\mathcal P, \mathcal Q)\)-total list colorings of graphs
• Colourful and fractional \((p,q)\)-theorems
• Fractional coloring and the odd Hadwiger's conjecture
• On fractional version of oriented coloring
• Generalized fractional total colorings of graphs
• Fractional Turan's theorem and bounds for the chromatic number
• Generalized fractional total colorings of complete graphs

Cited in

(8)

• List hereditary colorings of graphs (extended abstract)
• Generalized fractional and circular total colorings of graphs
• Path choosability of planar graphs
• On the \(\mathcal{P}\)-sum choice number of graphs for \(1\)-additive properties
• The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs
• CONSECUTIVE LIST COLOURING AND A NEW GRAPH INVARIANT
• Fractional \((\mathcal P, \mathcal Q)\)-total list colorings of graphs
• On (k,d)-colorings and fractional nowhere-zero flows

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 Q4518396)