Carlos S. Subi

According to our database1, Carlos S. Subi authored at least 18 papers between 1987 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
On Finding Hamiltonian Cycles in Barnette Graphs.
Fundam. Informaticae, 2022

2021
Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture.
J. Graph Theory, 2021

Distance-two colourings of Barnette graphs.
Eur. J. Comb., 2021

2019
Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints.
CoRR, 2019

2018
Distance-Two Colorings of Barnette Graphs.
CoRR, 2018

Distance-Two Coloring of Barnette Graphs.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2013
Edge-coloring almost bipartite multigraphs.
Inf. Process. Lett., 2013

On hypercube labellings and antipodal monochromatic paths.
Discret. Appl. Math., 2013

2012
Packing Edge-Disjoint Triangles in Given Graphs.
Electron. Colloquium Comput. Complex., 2012

2011
Maximum gap labelings of graphs.
Inf. Process. Lett., 2011

2009
Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations.
Inf. Process. Lett., 2009

2008
Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations (revised).
Electron. Colloquium Comput. Complex., 2008

2006
Partition into k-vertex subgraphs of k-partite graphs
Electron. Colloquium Comput. Complex., 2006

On Barnette's conjecture
Electron. Colloquium Comput. Complex., 2006

2005
Disks on a Tree: Analysis of a Combinatorial Game.
SIAM J. Discret. Math., 2005

2002
Approximating the Longest Cycle Problem in Sparse Graphs.
SIAM J. Comput., 2002

2000
Finding long paths and cycles in sparse Hamiltonian graphs.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1987
An Improved Block-Interchange Algorithm.
J. Algorithms, 1987


  Loading...