Reza Naserasr

Weiqiang Yu

J. Comb. Optim., March, 2024

A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

2023

Packing Signatures in Signed Graphs.

[BibT_eX]

[DOI]

Weiqiang Yu

SIAM J. Discret. Math., December, 2023

Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem.

[BibT_eX]

[DOI]

Zhouningxin Wang

Discret. Math., December, 2023

Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$.

[BibT_eX]

[DOI]

J. Graph Theory, November, 2023

A Note on Δ-Critical Graphs.

[BibT_eX]

[DOI]

Penny Haxell

Graphs Comb., October, 2023

Separating signatures in signed planar graphs.

[BibT_eX]

[DOI]

Weiqiang Yu

Discret. Appl. Math., October, 2023

A new graph parameter to measure linearity.

[BibT_eX]

[DOI]

J. Graph Theory, July, 2023

Circular ${\boldsymbol{(4-\epsilon )}}$ -Coloring of Some Classes of Signed Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., June, 2023

Balanced-chromatic number and Hadwiger-like conjectures.

[BibT_eX]

[DOI]

CoRR, 2023

Winding number and circular 4-coloring of signed graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Extended Double Covers and Homomorphism Bounds of Signed Graphs.

[BibT_eX]

[DOI]

Rongxing Xu

Electron. J. Comb., 2023

2022

Density of C-4-critical signed graphs.

[BibT_eX]

[DOI]

Lan Anh Pham

Zhouningxin Wang

J. Comb. Theory B, 2022

Complex and Homomorphic Chromatic Number of Signed Planar Simple Graphs.

[BibT_eX]

[DOI]

Lan Anh Pham

Graphs Comb., 2022

Smallest C2ℓ+1-critical graphs of odd-girth 2k+1.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

Edge clique covers in graphs with independence number two.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Homomorphisms of signed graphs: An update.

[BibT_eX]

[DOI]

Thomas Zaslavsky

Eur. J. Comb., 2021

Exact square coloring of subcubic planar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Circular Chromatic Number of Signed Graphs.

[BibT_eX]

[DOI]

Zhouningxin Wang

Xuding Zhu

Electron. J. Comb., 2021

Extension of Gyárfás-Sumner Conjecture to Digraphs.

[BibT_eX]

[DOI]

Pierre Aboulker

Pierre Charbit

Electron. J. Comb., 2021

Cliques in exact distance powers of graphs of given maximum degree.

[BibT_eX]

[DOI]

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

Homomorphisms of partial t-trees and edge-colorings of partial 3-trees.

[BibT_eX]

[DOI]

Meirun Chen

J. Comb. Theory B, 2020

Sensitivity lower bounds from linear dependencies.

[BibT_eX]

[DOI]

Sophie Laplante

Anupa Sunny

Electron. Colloquium Comput. Complex., 2020

Homomorphisms of Sparse Signed Graphs.

[BibT_eX]

[DOI]

Clément Charpentier

Electron. J. Comb., 2020

Smallest C2l+1-Critical Graphs of Odd-Girth 2k+1.

[BibT_eX]

[DOI]

Mohammad Reza Hooshmandasl

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

When an optimal dominating set with given constraints exists.

[BibT_eX]

[DOI]

Omid Etesami

Narges Ghareghani

Michel Habib

Pouyeh Sharifani

Theor. Comput. Sci., 2019

Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

Safe sets in graphs: Graph classes and structural parameters.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

The optimal routing of augmented cubes.

[BibT_eX]

[DOI]

Meirun Chen

Inf. Process. Lett., 2018

2017

Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Homomorphism bounds and edge-colourings of K4-minor-free graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

The complexity of signed graph and edge-coloured graph homomorphisms.

[BibT_eX]

[DOI]

Discret. Math., 2017

The complexity of tropical graph homomorphisms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Towards A Unified View of Linear Structure on Graph Classes.

[BibT_eX]

[DOI]

CoRR, 2017

Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity.

[BibT_eX]

[DOI]

Algorithmica, 2017

2016

Walk-Powers and Homomorphism Bounds of Planar Signed Graphs.

[BibT_eX]

[DOI]

Sagnik Sen

Qiang Sun

Graphs Comb., 2016

Mapping planar graphs into the Coxeter graph.

[BibT_eX]

[DOI]

Discret. Math., 2016

Bipartite edge partitions and the former Alon-Saks-Seymour conjecture.

[BibT_eX]

[DOI]

Australas. J Comb., 2016

Safe Sets in Graphs: Graph Classes and Structural Parameters.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Homomorphisms of Signed Graphs.

[BibT_eX]

[DOI]

Edita Rollová

J. Graph Theory, 2015

Homomorphisms of binary Cayley graphs.

[BibT_eX]

[DOI]

Claude Tardif

Discret. Math., 2015

Walk-powers and homomorphism bound of planar graphs.

[BibT_eX]

[DOI]

Sagnik Sen

Qiang Sun

CoRR, 2015

The complexity of signed graph and 2-edge-coloured graph homomorphisms.

[BibT_eX]

[DOI]

CoRR, 2015

From Edge-Coloring to Strong Edge-Coloring.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

2014

Identification, location-domination and metric dimension on interval and permutation graphs.

[BibT_eX]

[DOI]

CoRR, 2014

The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013

Mapping Planar Graphs into Projective Cubes.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

Identifying Codes in Line Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

Characterizing Extremal Digraphs for Identifying Codes and Extremal Cases of Bondy's Theorem on Induced Subsets.

[BibT_eX]

[DOI]

Aline Parreau

Graphs Comb., 2013

Homomorphisms of planar signed graphs to signed projective cubes.

[BibT_eX]

[DOI]

Edita Rollová

Discret. Math. Theor. Comput. Sci., 2013

2012

Vertex-colouring edge-weightings with two edge weights.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2012

2011

Edge identifying codes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Extremal graphs for the identifying code problem.

[BibT_eX]

[DOI]

Eur. J. Comb., 2011

Digraphs are 2-Weight Choosable.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

2010

Extremal problems on identifying codes in digraphs and Bondy's theorem on induced subsets

[BibT_eX]

[DOI]

Aline Parreau

CoRR, 2010

2009

Homomorphisms of triangle-free graphs without a K5-minor.

[BibT_eX]

[DOI]

Yared Nigussie

Riste Skrekovski

Discret. Math., 2009

2007

Circular Coloring the Plane.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

Homomorphisms and edge-colourings of planar graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

2006

The chromatic covering number of a graph.

[BibT_eX]

[DOI]

Claude Tardif

J. Graph Theory, 2006

K5-Free bound for the class of planar graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

On a new reformulation of Hadwiger's conjecture.

[BibT_eX]

[DOI]

Yared Nigussie

Discret. Math., 2006

2003

The Petersen graph is not 3-edge-colorable--a new proof.

[BibT_eX]

[DOI]

Riste Skrekovski

Discret. Math., 2003

On Some Parameters Related to Uniquely Vertex-Colourable Graphs and Defining Sets.

[BibT_eX]

Amir Daneshgar

Ars Comb., 2003

2000

On small uniquely vertex-colourable graphs and Xu's conjecture.

[BibT_eX]

[DOI]

Amir Daneshgar

Gholamreza B. Khosrovshahi

Discret. Math., 2000

1999

Hypergraphical Codes Arising from Binary Trades.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1999

1997

Defining sets in vertex colorings of graphs and latin rectangles.

[BibT_eX]

[DOI]

Ebadollah S. Mahmoodian