Oriented colorings of triangle-free planar graphs

DOI10.1016/J.IPL.2004.06.012MaRDI QIDQ834898zbMATH OpenOpenAlexFDO

Authors Pascal Ochem

Publication date 27 August 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2004.06.012

zbMATH Keywords

combinatorial problemsdischargingoriented coloring

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• scientific article; zbMATH DE number 3342024 (Why is no real title available?)
• Antisymmetric flows and strong colourings of oriented graphs
• Good and semi-strong colorings of oriented planar graphs
• Note to the paper of Grünbaum on acyclic colorings
• On acyclic colorings of planar graphs
• On the maximum average degree and the oriented chromatic number of a graph
• Oriented graph coloring

Cited in

(13)

• Homomorphisms and colourings of oriented graphs: an updated survey
• Homomorphism bounds for oriented planar graphs of given minimum girth
• An oriented 6-coloring of planar graphs with girth at least 9
• On the oriented chromatic number of Halin graphs
• Oriented vertex and arc colorings of outerplanar graphs
• Oriented colorings of 2-outerplanar graphs
• The 2-dipath chromatic number of Halin graphs
• Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
• Oriented colorings of partial 2-trees
• An oriented coloring of planar graphs with girth at least five
• On coloring parameters of triangle-free planar \((n, m)\)-graphs
• A study on oriented relative clique number
• Oriented cliques and colorings of graphs with low maximum degree

This page was built for publication: Oriented colorings of triangle-free planar graphs

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