Results 41 to 50 of about 1,010 (104)
A Survey on the Cyclic Coloring and its Relaxations
Discussiones Mathematicae Graph Theory, 2021 A cyclic coloring of a plane graph is a vertex coloring such that any two vertices incident with the same face receive distinct colors. This type of coloring was introduced more than fifty years ago, and a lot of research in chromatic graph theory was ...
Czap Július +2 more
doaj +1 more source
Infant Mental Health Journal: Infancy and Early Childhood, Volume 45, Issue 2, Page 234-246, March 2024.Abstract Improving parental sensitivity is an important objective of interventions to support families. This study examined reliability and validity of parental sensitivity ratings using a novel package of an e‐learning tool and an interactive decision tree provided through a mobile application, called the OK! package.
Mirte L. Forrer +3 more
wiley +1 more source
Coverings of Cubic Graphs and 3-Edge Colorability
Discussiones Mathematicae Graph Theory, 2021 Let h:G˜→Gh:\tilde G \to G be a finite covering of 2-connected cubic (multi)graphs where G is 3-edge uncolorable. In this paper, we describe conditions under which G˜\tilde G is 3-edge uncolorable. As particular cases, we have constructed regular and
Plachta Leonid
doaj +1 more source
The 4-girth-thickness of the complete multipartite graph
, 2019 The $g$-girth-thickness $\theta(g,G)$ of a graph $G$ is the smallest number of planar subgraphs of girth at least $g$ whose union is $G$. In this paper, we calculate the $4$-girth-thickness $\theta(4,G)$ of the complete $m$-partite graph $G$ when each ...
Rubio-Montiel, Christian
core +1 more source
The Crossing Number of Cartesian Product of 5-Wheel with any Tree
Discussiones Mathematicae Graph Theory, 2021 In this paper, we establish the crossing number of join product of 5-wheel with n isolated vertices. In addition, the exact values for the crossing numbers of Cartesian products of the wheels of order at most five with any tree T are given.
Wang Yuxi, Huang Yuanqiu
doaj +1 more source
Complexity of domination in triangulated plane graphs
Acta Universitatis Sapientiae: Informatica, 2019 We prove that for a triangulated plane graph it is NP-complete to determine its domination number and its power domination number.
Pálvölgyi Dömötör
doaj +1 more source
Realizing the chromatic numbers and orders of spinal quadrangulations of surfaces [PDF]
, 2013 A method is suggested for construction of quadrangulations of the closed orientable surface with given genus g and either (1) with given chromatic number or (2) with given order allowed by the genus g. In particular, N. Hartsfield and G. Ringel's results
Lawrencenko, Serge
core
Fundamental Cycles and Graph Embeddings
, 2008 In this paper we present a new Good Characterization of maximum genus of a graph which makes a common generalization of the works of Xuong, Liu, and Fu et al.
B. Mohar +10 more
core +2 more sources
A Note on the Upper Bounds on the Size of Bipartite and Tripartite 1-Embeddable Graphs on Surfaces
Discussiones Mathematicae Graph Theory, 2023 In this note, we show sharp upper bounds of the size of simple bipartite and tripartite 1-embeddable graphs on closed surfaces.
Shibuya Hikari, Suzuki Yusuke
doaj +1 more source
Facial Incidence Colorings of Embedded Multigraphs
Discussiones Mathematicae Graph Theory, 2019 Let G be a cellular embedding of a multigraph in a 2-manifold. Two distinct edges e1, e2 ∈ E(G) are facially adjacent if they are consecutive on a facial walk of a face f ∈ F(G). An incidence of the multigraph G is a pair (v, e), where v ∈ V (G), e ∈ E(G)
Jendrol’ Stanislav +2 more
doaj +1 more source