scientific article; zbMATH DE number 1536522
From MaRDI portal
Publication:4518396
zbMATH Open0951.05035MaRDI QIDQ4518396FDOQ4518396
Authors: Peter Mihók, Zsolt Tuza, Margit Voigt 
Publication date: 28 November 2000
Title of this publication is not available (Why is that?)
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
choosabilityhypergraph colouringhereditary properties of graphs\(\mathcal P\)-choice ratiofractional \(\mathcal P\)-colouring
Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)
Cited In (8)
- Path choosability of planar graphs
- The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs
- Fractional \((\mathcal P, \mathcal Q)\)-total list colorings of graphs
- CONSECUTIVE LIST COLOURING AND A NEW GRAPH INVARIANT
- List hereditary colorings of graphs (extended abstract)
- On the \(\mathcal{P}\)-sum choice number of graphs for \(1\)-additive properties
- Generalized fractional and circular total 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)
