Incidence coloring of \(k\)-degenerated graphs
From MaRDI portal
Publication:1827780
DOI10.1016/j.disc.2004.01.015zbMath1064.05057OpenAlexW2038298582MaRDI QIDQ1827780
Mohammad Hosseini Dolama, Xuding Zhu, Eric Sopena
Publication date: 6 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.01.015
Related Items (25)
Facial incidence colorings of embedded multigraphs ⋮ Oriented incidence colourings of digraphs ⋮ Incidence coloring on hypercubes ⋮ On incidence coloring conjecture in Cartesian products of graphs ⋮ Interval incidence coloring of bipartite graphs ⋮ Note on incidence chromatic number of subquartic graphs ⋮ Reconstructing a graph from its arc incidence graph ⋮ On incidence coloring of graph fractional powers ⋮ Strong incidence coloring of outerplanar graphs ⋮ On incidence coloring of complete multipartite and semicubic bipartite graphs ⋮ Hypergraph incidence coloring ⋮ Unnamed Item ⋮ Interval incidence coloring of subcubic graphs ⋮ The incidence game chromatic number ⋮ Interval incidence graph coloring ⋮ The incidence game chromatic number of paths and subgraphs of wheels ⋮ The incidence game chromatic number of \((a,d)\)-decomposable graphs ⋮ Incidence coloring of pseudo-Halin graphs ⋮ Incidence coloring -- cold cases ⋮ Incidence coloring of the squares of some graphs ⋮ Invalid proofs on incidence coloring ⋮ Incidence coloring of mycielskians with fast algorithm ⋮ Incidence choosability of graphs ⋮ Some results on the incidence coloring number of a graph ⋮ Incidence coloring of graphs with high maximum average degree
Cites Work
- Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
- Incidence and strong edge colorings of graphs
- On incidence coloring and star arboricity of graphs
- On incidence coloring for some cubic graphs
- The star arboricity of graphs
- The incidence coloring number of Halin graphs and outerplanar graphs
This page was built for publication: Incidence coloring of \(k\)-degenerated graphs