Injective colorings with arithmetic constraints
From MaRDI portal
Publication:897262
DOI10.1007/S00373-014-1520-3zbMATH Open1327.05098OpenAlexW2060730025WikidataQ114229667 ScholiaQ114229667MaRDI QIDQ897262FDOQ897262
Martin Matamala, Ioan Todinca, José Zamora, Mathieu Chapelle, Natacha Astromujoff
Publication date: 17 December 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/147976
Recommendations
- Injective coloring of graphs revisited
- On the complexity of injective colorings and its generalizations
- Almost injective colorings
- Injective oriented colourings
- Counterexamples to a conjecture on injective colorings
- scientific article
- Injective colorings of planar graphs with few colors
- Injective coloring of planar graphs
- Injective coloring of planar graphs
- Injective colorings of sparse graphs
Cites Work
- An improved construction of progression-free sets
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The NP-Completeness of Edge-Coloring
- On triples in arithmetic progression
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Labelling Graphs with a Condition at Distance 2
- On Certain Sets of Integers
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- The $L(2,1)$-Labeling Problem on Graphs
- Zero knowledge and the chromatic number
- Integer sets containing no arithmetic progressions
- Integer Sets Containing No Arithmetic Progressions
- Title not available (Why is that?)
- On the injective chromatic number of graphs
- On Injective Colourings of Chordal Graphs
- A Linear Time Algorithm for L(2,1)-Labeling of Trees
- Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
- Finding large 3-free sets. I. The small \(n\) case
Cited In (1)
This page was built for publication: Injective colorings with arithmetic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897262)
