Digraphs are 2-weight choosable

MaRDI QIDQ625384zbMATH OpenFDO

Authors Mahdad Khatirinejad, Reza Naserasr, Ben Seamone, Brett Stevens, Mike Newman

Publication date 17 February 2011

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/228343, http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p21.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

digraphsedge weighting vertex coloringweight colorability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Recommendations

• Weight choosability of graphs
• Vertex-colouring edge-weightings with two edge weights
• Total weight choosability of graphs
• Vertex coloring edge-weighted digraphs
• A note on edge weight choosability of graphs

Cited in

(9)

• On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
• Local antimagic orientations of \(d\)-degenerate graphs
• Deza digraphs. II.
• An oriented version of the 1-2-3 conjecture
• Algorithmic complexity of proper labeling problems
• A solution to the 1-2-3 conjecture
• 1-2-3 Conjecture in digraphs: more results and directions
• Weight choosability of oriented hypergraphs
• On a directed variation of the 1-2-3 and 1-2 conjectures

This page was built for publication: Digraphs are 2-weight choosable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625384)