Some computational aspects of solvable regular covers of graphs (original) (raw)
Related papers
3-CONNECTED Reduction for Regular Graph Covers
European Journal of Combinatorics, 2018
Revisiting the vertex cover of graphs
Applied Mathematical Sciences, 2015
Generalized Bounded Tree Cover of a Graph
Journal of Graph Algorithms and Applications
On Some Classes of Problems on Graphs
International Conference on Information and Communication Technologies in Education, Research, and Industrial Applications, 2019
On regular graphs equienergetic with their complements
Linear and multilinear algebra, 2022
On decomposing regular graphs into locally irregular subgraphs
European Journal of Combinatorics, 2015
An algebraic theory of graph reduction
Journal of the ACM, 1993
New small regular graphs of girth 5
Discrete Mathematics, 2017
On the Geometry of Graph Arrangements
2004
On classes of regular graphs with constant metric dimension
Acta Mathematica Scientia, 2013
Journal of Graph Algorithms and Applications
On Triangle Cover Contact Graphs
Nazmun Nessa Moon, Shaheena Sultana
Lecture Notes in Computer Science, 2015
The structure of (t,r)-regular graphs of large order
Discrete Mathematics, 2003
Energies of some Non-regular Graphs
Journal of Mathematical Chemistry, 2006
Journal of Combinatorial Theory, Series B, 1997
Journal of Discrete Mathematical Sciences and Cryptography, 2012
Algorithmic Aspects of Regular Graph Covers
ArXiv, 2016
On large regular (1,1,k)-mixed graphs
arXiv (Cornell University), 2023
Covers of the Higman-Sims graph and their automorphisms
Doklady Mathematics, 2008
Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs
Lecture Notes in Computer Science, 2014
On the independent domination number of regular graphs
2011
Vertex Covers by Edge Disjoint Cliques
Combinatorica, 2001
Feasibility Conditions on the Parameters of a Strongly Regular Graph
Electronic Notes in Discrete Mathematics, 2011
Improving bounds on the order of regular graphs of girth 5
Discrete Mathematics, 2019
The critical complexity of graph properties
Information Processing Letters, 1984
On the Maximum Number of Vertices of Critically Embedded Graphs
International Electronic Journal of Geometry, 2015
There are no non-trivially uniformly (t,r)-regular graphs for t>2
2-SIZE Resolvability in Graphs
Bounding and computing obstacle numbers of graphs
arXiv (Cornell University), 2022
Electronic Notes in Discrete Mathematics, 2011
A linear-time algorithm for thek-fixed-endpoint path cover problem on cographs
Networks, 2007
New infinite family of regular edge-isoperimetric graphs
Theoretical Computer Science, 2018
On the threshold for k-regular subgraphs of random graphs
2016
On edge irregularity strength of graphs
Applied Mathematics and Computation, 2014
Progress in Algebraic Combinatorics