On incidence coloring and star arboricity of graphs

From MaRDI portal
Publication:1356555

DOI10.1016/0012-365X(95)00342-TzbMath0871.05022OpenAlexW1996971186WikidataQ127109472 ScholiaQ127109472MaRDI QIDQ1356555

Barry Guiduli

Publication date: 9 June 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00342-t




Related Items

Facial incidence colorings of embedded multigraphsIncidence coloring on hypercubesOn incidence coloring conjecture in Cartesian products of graphsDistinguishing arc-colourings of symmetric digraphsInterval incidence coloring of bipartite graphsThe acircuitic directed star arboricity of subcubic graphs is at most fourNote on incidence chromatic number of subquartic graphsUnnamed ItemOn incidence coloring of graph fractional powersOn incidence coloring of complete multipartite and semicubic bipartite graphsOn spanning galaxies in digraphsDefective incidence coloring of graphsWDM and Directed Star ArboricityNP-completeness of 4-incidence colorability of semi-cubic graphsInterval incidence coloring of subcubic graphsThe incidence game chromatic numberOn incidence choosability of cubic graphsInterval incidence graph coloringThe incidence game chromatic number of paths and subgraphs of wheelsThe incidence coloring conjecture for graphs of maximum degree 3Incidence coloring of pseudo-Halin graphsThe incidence coloring numbers of meshesIncidence coloring -- cold casesIncidence coloring of the squares of some graphsIncidence coloring of mycielskians with fast algorithmMaximum directed cuts in digraphs with degree restrictionIncidence coloring of \(k\)-degenerated graphsA Note on Incidence graphsRecent progress on strong edge-coloring of graphsSome results on the incidence coloring number of a graphSpanning galaxies in digraphsIncidence coloring of Cartesian product graphsIncidence coloring of graphs with high maximum average degree



Cites Work