Incidence and strong edge colorings of graphs

From MaRDI portal
Publication:1313849

DOI10.1016/0012-365X(93)90286-3zbMath0790.05026OpenAlexW1993409199MaRDI QIDQ1313849

Jennifer J. Quinn Massey, Richard A. Brualdi

Publication date: 22 June 1994

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90286-3




Related Items (64)

New results in vague incidence graphs with applicationClique number of the square of a line graphFacial incidence colorings of embedded multigraphsOriented incidence colourings of digraphsIncidence coloring on hypercubesOn incidence coloring conjecture in Cartesian products of graphsDistinguishing arc-colourings of symmetric digraphsThe strong equitable vertex 2-arboricity of complete bipartite and tripartite graphsInterval incidence coloring of bipartite graphsOn incidence coloring and star arboricity of graphsStrong chromatic index of graphs with maximum degree fourNote on incidence chromatic number of subquartic graphsOn the adjacent vertex-distinguishing equitable edge coloring of graphsReconstructing a graph from its arc incidence graphStrong Chromatic Index of Chordless GraphsInduced matchings in subcubic graphs without short cyclesUnnamed ItemOn incidence coloring of graph fractional powersList strong edge-colorings of sparse graphsStrong edge-coloring for cubic Halin graphsNew results and open problems in line graphsSimultaneous coloring of vertices and incidences of outerplanar graphsStrong incidence coloring of outerplanar graphsOn incidence coloring of complete multipartite and semicubic bipartite graphsHypergraph incidence coloringUnnamed ItemDefective incidence coloring of graphsUnnamed ItemThe strong chromatic index of sparse graphsA note on the strong chromatic index of bipartite graphsStrong edge-coloring of \((3, \varDelta)\)-bipartite graphsNP-completeness of 4-incidence colorability of semi-cubic graphsThe strong chromatic index of \((3,\Delta)\)-bipartite graphsThe incidence game chromatic numberInterval incidence coloring of subcubic graphsThe incidence game chromatic numberFractional strong chromatic index of bipartite graphsOn incidence choosability of cubic graphsInterval incidence graph coloringThe incidence game chromatic number of paths and subgraphs of wheelsStrong Chromatic Index of 2-Degenerate GraphsThe incidence coloring conjecture for graphs of maximum degree 3The incidence game chromatic number of \((a,d)\)-decomposable graphsIncidence coloring of pseudo-Halin graphsThe incidence coloring numbers of meshesOn star edge colorings of bipartite and subcubic graphsIncidence coloring -- cold casesInjective edge-coloring of graphs with given maximum degreeThe strong chromatic index of a class of graphsIncidence coloring of the squares of some graphsInvalid proofs on incidence coloringStrong edge-coloring for jellyfish graphsIncidence coloring of mycielskians with fast algorithmThe strong edge-coloring for graphs with small edge weightIncidence choosability of graphsOn \(S\)-packing edge-colorings of graphs with small edge weightIncidence coloring of \(k\)-degenerated graphsA Note on Incidence graphsProper distinguishing arc-colourings of symmetric digraphsRecent progress on strong edge-coloring of graphsSome results on the incidence coloring number of a graphIncidence coloring of Cartesian product graphsStrong edge coloring of Cayley graphs and some product graphsIncidence coloring of graphs with high maximum average degree



Cites Work


This page was built for publication: Incidence and strong edge colorings of graphs