Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs

Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs

Bibliographic Details
Main Authors:	MacKenzie Carr, Christina M. Mynhardt, Ortrud R. Oellermann
Format:	Article
Language:	English
Published:	University of Zielona Góra 2023-01-01
Series:	Discussiones Mathematicae Graph Theory
Online Access:	https://www.dmgt.uz.zgora.pl/?doi=10.7151/dmgt.2407

Similar Items

Embedding complete multi-partite graphs into Cartesian product of paths and cycles
by: R. Sundara Rajan, et al.
Published: (2021-10-01)

On Path-Pairability in the Cartesian Product of Graphs
by: Mészáros Gábor
Published: (2016-08-01)

Applied and algorithmic graph theory /
by: 305202 Chartrand, Gary, et al.
Published: (1993)

On dynamic colouring of cartesian product of complete graph with some graphs
by: K. Kaliraj, et al.
Published: (2020-01-01)

Enumerating Triangulations of Convex Polytopes
by: Sergei Bespamyatnikh
Published: (2001-01-01)

On the enumeration of column-convex permutominoes
by: Nicholas R. Beaton, et al.
Published: (2011-01-01)

The necessity of conditions for graph quantum ergodicity and Cartesian products with an infinite graph
by: McKenzie, Theo
Published: (2022-04-01)

graph, Hamiltonian path, Hamiltonian cycle, Hamilton-connected graph, detour index, NP-complete problems, Platonic solids, convex polytopes
by: Abdelgader Siddig, et al.
Published: (2021-02-01)

Completely independent spanning trees in some Cartesian product graphs
by: Xia Hong, et al.
Published: (2023-05-01)

The Threshold Dimension and Irreducible Graphs
by: Mol Lucas, et al.
Published: (2023-02-01)

The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths
by: Bety Hayat Susanti, et al.
Published: (2020-04-01)

On Unique Minimum Dominating Sets in Some Cartesian Product Graphs
by: Hedetniemi Jason T.
Published: (2015-11-01)

Enumeration of convex polyominoes using the ECO method
by: A. Del Lungo, et al.
Published: (2003-01-01)

A perimeter enumeration of column-convex polyominoes
by: Svjetlan Feretić
Published: (2007-01-01)

A perimeter enumeration of column-convex polyominoes
by: Svjetlan Feretic
Published: (2007-01-01)

On the Strong Path Partition Conjecture
by: Johan de Wet, et al.
Published: (2024-01-01)

Enumerating Hamiltonian Cycles in a Planar Graph Using Combinatorial Cycle Bases
by: Retno MAHARESI
Published: (2016-04-01)

Decompositions of Complete Bipartite Graphs and Complete Graphs Into Paths, Stars, and Cycles with Four Edges Each
by: Shyu Tay-Woei
Published: (2021-05-01)

Cartesian products as profinite completions
by: Kassabov, M, et al.
Published: (2006)

Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars
by: Lee Hung-Chih, et al.
Published: (2020-08-01)

Enumeration of partial Łukasiewicz paths
by: Jean-Luc Baril, et al.
Published: (2022-09-01)

Distance Magic Cartesian Products of Graphs
by: Cichacz Sylwia, et al.
Published: (2016-05-01)

Motion planning in cartesian product graphs
by: Deb Biswajit, et al.
Published: (2014-05-01)

On Total Domination in the Cartesian Product of Graphs
by: Brešar Boštjan, et al.
Published: (2018-11-01)

The Thickness of Amalgamations and Cartesian Product of Graphs
by: Yang Yan, et al.
Published: (2017-08-01)

Distinguishing Cartesian Products of Countable Graphs
by: Estaji Ehsan, et al.
Published: (2017-02-01)

Geodesic bipancyclicity of the Cartesian product of graphs
by: Amruta Shinde, et al.
Published: (2022-07-01)

Betweenness centrality in Cartesian product of graphs
by: Sunil Kumar R., et al.
Published: (2020-01-01)

Tolerant Radon partitions on the all-paths convexity in graphs
by: Sreekumar Sreedharan, et al.
Published: (2024-01-01)

Convex Partitions of Graphs induced by Paths of Order Three
by: C. C. Centeno, et al.
Published: (2010-01-01)

Enumeration and structure of inhomogeneous graphs
by: Élie De Panafieu
Published: (2015-01-01)

COMPARISON AND ENUMERATION OF CHEMICAL GRAPHS
by: Tatsuya Akutsu, et al.
Published: (2013-02-01)

Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies
by: Shimizu Masaaki, et al.
Published: (2011-12-01)

A note on star coloring of central graph of bipartite graph and corona graph of complete graph with path and cycle
by: V. J. Vernold, et al.
Published: (2012-03-01)

Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank
by: Naveed Ahmed Azam, et al.
Published: (2020-11-01)

A complete enumeration of Ballot permutations avoiding sets of small patterns
by: Nathan Sun
Published: (2022-11-01)

On Nontrivial Covers and Partitions of Graphs by Convex Sets
by: Radu Buzatu, et al.
Published: (2018-05-01)

On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph
by: Olivier Baudon, et al.
Published: (2014-04-01)

Crossing number of Cartesian product of prism and path
by: Yip C. Yiew, et al.
Published: (2020-09-01)

The generalized 3-connectivity of Cartesian product graphs
by: Hengzhe Li, et al.
Published: (2012-03-01)