A note on a directed version of the 1-2-3 conjecture (Q1693177): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q122979018, #quickstatements; #temporary_batch_1712272666262 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On a directed variation of the 1-2-3 and 1-2 conjectures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An oriented version of the 1-2-3 conjecture / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Coloring chip configurations on graphs and digraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A New Upper Bound for the Irregularity Strength of Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edge weights and vertex colours / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounding the weight choosability number of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture / rank | |||
Normal rank | |||
Revision as of 22:11, 14 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on a directed version of the 1-2-3 conjecture |
scientific article |
Statements
A note on a directed version of the 1-2-3 conjecture (English)
0 references
11 January 2018
0 references
edge coloring
0 references
digraph
0 references
1-2-3 conjecture
0 references
