2 citations · 5 across the 8 of their papers we have counts for
8 papers
On heroes in digraphs with forbidden induced forests
Alvaro Carbonero, Hidde Koerts, Benjamin Moore +1
We continue a line of research which studies which hereditary families of digraphs have bounded dichromatic number. For a class of digraphs , a hero in i…
Digraphs with all induced directed cycles of the same length are not -bounded
Alvaro Carbonero, Patrick Hompe, Benjamin Moore +1
For , let us call a digraph \emph{t-chordal} if all induced directed cycles in have length equal to . In a previous paper, we asked for which it is true tha…
The Inter-magic Spectra of Trees
Alvaro Carbonero, Dylan Obata
For any positive integer , a graph is said to be -magic if there exists a labeling such that the induced vertex set labeling $\ l^+…
A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number
Alvaro Carbonero, Patrick Hompe, Benjamin Moore +1
We prove that for every , there is a graph with and such that every induced subgraph of with satisfies . This…
The Optimization of Signed Trees
Alvaro Carbonero, Janelle Domantay, Karen Guthrie
A signed graph is a graph where each edge is assigned a + (positive edge) or a - (negative edge). The signed degree of a vertex in a signed graph, denoted by , is…
Crowns in linear -graphs
Alvaro Carbonero, Willem Fletcher, Jing Guo +3
A \textit{linear -graph}, , is a set, , of vertices together with a set, , of -element subsets of , called edges, so that any two distinct edges intersec…
Towards a characterization of convergent sequences of -line graphs
Alvaro Carbonero
Let and be graphs such that has at least 3 vertices and is connected. The -line graph of , denoted by , is that graph whose vertices are the edges of a…
Permutations of point sets in
Alvaro Carbonero, Beth Anne Castellano, Gary Gordon +3
Given a set consisting of points in and one or two vantage points, we study the number of orderings of induced by measuring the distance (for one vantage…