Linear colorings of subcubic graphs

DOI10.1016/j.ejc.2013.02.008zbMath1285.05065arXiv1206.5348OpenAlexW1982933944MaRDI QIDQ2444734

Chun-Hung Liu, Gexin Yu

Publication date: 11 April 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.5348

zbMATH Keywords

linear-time algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items

Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth ⋮ Linear list coloring of some sparse graphs ⋮ Remarks on proper conflict-free colorings of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Linear coloring of sparse graphs
• Improved bounds on linear coloring of plane graphs
• Upper bounds on the linear chromatic number of a graph
• Linear and 2-frugal choosability of graphs of small maximum average degree
• Acyclic colorings of subcubic graphs
• \(\Delta \)-list vertex coloring in linear time
• Linear choosability of graphs
• Acyclic edge coloring of subcubic graphs
• Linear coloring of planar graphs with large girth
• Colouring a graph frugally
• Linear coloring of graphs
• On list edge-colorings of subcubic graphs
• Linear choosability of sparse graphs
• On arc-coloring of subcubic graphs
• List-coloring the square of a subcubic graph
• List-Coloring Squares of Sparse Subcubic Graphs
• Acyclic colorings of planar graphs

This page was built for publication: Linear colorings of subcubic graphs