Interval incidence coloring of subcubic graphs
From MaRDI portal
Publication:521761
DOI10.7151/dmgt.1962zbMath1359.05044OpenAlexW2589022845MaRDI QIDQ521761
Michał Małafiejski, Anna Małafiejska
Publication date: 12 April 2017
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1962
Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Invalid proofs on incidence coloring
- Star arboricity
- Incidence and strong edge colorings of graphs
- Investigation on interval edge-colorings of graphs
- On incidence coloring and star arboricity of graphs
- On incidence coloring of complete multipartite and semicubic bipartite graphs
- The incidence coloring conjecture for graphs of maximum degree 3
- Incidence coloring of \(k\)-degenerated graphs
- Interval incidence graph coloring
- Incidence coloring of Cartesian product graphs
- NP-completeness of 4-incidence colorability of semi-cubic graphs
- Interval incidence coloring of bipartite graphs
- On Representatives of Subsets
- Consecutive colorings of the edges of general graphs