10.9k citations
- University of MichiganUS1.5k papers
- Michigan State UniversityUS1.5k papers
- Centre National de la Recherche ScientifiqueFR1.4k papers
- Lawrence Berkeley National LaboratoryUS1.4k papers
- McGill UniversityCA1.4k papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR1.3k papers
- University of ManchesterGB1.3k papers
- University of LiverpoolGB1.3k papers
- University of TorontoCA1.3k papers
- University of OxfordGB1.3k papers
- TRIUMFCA1.3k papers
- Argonne National LaboratoryUS1.3k papers
10 papers · 2 filters
The difference and ratio of the fractional matching number and the matching number of graphs
Ilkyoo Choi, Jaehoon Kim, Suil O
Given a graph , the matching number of , written , is the maximum size of a matching in , and the fractional matching number of , written , is the maxim…
Spectral bound for separations in Eulerian digraphs
Krystal Guo
The spectra of digraphs, unlike those of graphs, is a relatively unexplored territory. In a digraph, a separation is a pair of sets of vertices X and Y such that there are no arcs…
An algebraic approach to enumerating non-equivalent double traces in graphs
Nino Bašić, Drago Bokal, Tomas Boothby +1
Recently designed biomolecular approaches to build single chain polypeptide polyhedra as molecular origami nanostructures have risen high interest in various double traces of the u…
Colourings, Homomorphisms, and Partitions of Transitive Digraphs
Tomás Feder, Pavol Hell, César Hernández-Cruz
We investigate the complexity of generalizations of colourings (acyclic colourings, -colourings, homomorphisms, and matrix partitions), for the class of transitive digrap…
Dichromatic number and fractional chromatic number
Bojan Mohar, Hehui Wu
The dichromatic number of a graph is the maximum integer such that there exists an orientation of the edges of such that for every partition of the vertices into fewer…
On the chromatic number of Latin square graphs
Nazli Besharati, Luis Goddyn, E. S. Mahmoodian +1
The chromatic number of a Latin square is the least number of partial transversals which cover its cells. This is just the chromatic number of its associated Latin square graph. Al…