Interval incidence coloring of bipartite graphs
From MaRDI portal
Publication:2636801
DOI10.1016/j.dam.2013.10.007zbMath1283.05104MaRDI QIDQ2636801
Robert Janczewski, Anna Małafiejska, Michał Małafiejski
Publication date: 18 February 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.10.007
05C05: Trees
05C15: Coloring of graphs and hypergraphs
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Interval incidence coloring of subcubic graphs, Interval incidence graph coloring, Interval incidence coloring of bipartite graphs, Hypergraph incidence coloring, Defective incidence coloring of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Invalid proofs on incidence coloring
- Some results on the incidence coloring number of a graph
- Star arboricity
- Incidence and strong edge colorings of graphs
- Investigation on interval edge-colorings of graphs
- On incidence coloring and star arboricity of graphs
- Incidence coloring of \(k\)-degenerated graphs
- The incidence coloring number of Halin graphs and outerplanar graphs
- Interval incidence coloring of bipartite graphs
- WDM and Directed Star Arboricity
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Compact Scheduling In Open Shop With Zero-One Time Operations
- Consecutive colorings of the edges of general graphs
