The acircuitic directed star arboricity of subcubic graphs is at most four

DOI10.1016/J.DISC.2006.06.007zbMATH Open1106.05050OpenAlexW2025238842MaRDI QIDQ856877FDOQ856877

Authors: Alexandre Pinlou, Éric Sopena 

Publication date: 14 December 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.06.007

Recommendations

• Bounds on directed star arboricity in some digraph classes
• The star arboricity of graphs
• Star arboricity of graphs
• On the star arboricity of hypercubes
• scientific article; zbMATH DE number 125471
• Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs
• On a star chromatic index of subcubic graphs
• The star-arboricity of the complete regular multipartite graphs
• The 4-star graph is not a subgraph of any hypercube
• The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs

zbMATH Keywords

directed star forest

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• On the maximum average degree and the oriented chromatic number of a graph
• Good and semi-strong colorings of oriented planar graphs
• Acyclic and oriented chromatic numbers of graphs
• Oriented graph coloring
• On incidence coloring and star arboricity of graphs
• The star arboricity of graphs
• The monadic second order logic of graphs. VI: On several representations of graphs by relational structures

Cited In (2)

• WDM and directed star arboricity
• Bounds on directed star arboricity in some digraph classes

This page was built for publication: The acircuitic directed star arboricity of subcubic graphs is at most four

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