Fractional coloring planar graphs under Steinberg-type conditions

DOI10.1007/s10114-022-1085-7zbMath1520.05035MaRDI QIDQ6113758

Jiaao Li, Xiaolan Hu

Publication date: 11 July 2023

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

zbMATH Keywords

planar graphshomomorphismgirthfractional coloringcircular coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Circular coloring and fractional coloring in planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Steinberg's conjecture is false
• The weak 3-flow conjecture and the weak circular flow conjecture
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Homomorphisms from sparse graphs with large girth.
• Density of 5/2-critical graphs
• Counterexamples to Jaeger's circular flow conjecture
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• High-girth graphs avoiding a minor are nearly bipartite
• Mapping Planar Graphs into Projective Cubes
• Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph
• A (<5)-Colour Theorem for Planar Graphs
• (2 + ?)-Coloring of planar graphs with large odd-girth
• Circular Flows in Planar Graphs
• A Contribution to the Theory of Chromatic Polynomials
• Circular chromatic number of planar graphs of large odd girth
• Circular coloring and fractional coloring in planar graphs

This page was built for publication: Fractional coloring planar graphs under Steinberg-type conditions