Results 31 to 40 of about 1,099 (125)

A Note on the Upper Bounds on the Size of Bipartite and Tripartite 1-Embeddable Graphs on Surfaces

open access: yesDiscussiones 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

The Crossing Numbers of Join of Some Graphs with n Isolated Vertices

open access: yesDiscussiones Mathematicae Graph Theory, 2018
There are only few results concerning crossing numbers of join of some graphs. In this paper, for some graphs on five vertices, we give the crossing numbers of its join with n isolated vertices.
Ding Zongpeng, Huang Yuanqiu
doaj   +1 more source

The 4-girth-thickness of the complete multipartite graph

open access: yes, 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

Fundamental Cycles and Graph Embeddings

open access: yes, 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

Facial [r,s,t]-Colorings of Plane Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2019
Let G be a plane graph. Two edges are facially adjacent in G if they are consecutive edges on the boundary walk of a face of G. Given nonnegative integers r, s, and t, a facial [r, s, t]-coloring of a plane graph G = (V,E) is a mapping f : V ∪ E → {1, . .
Czap Július   +3 more
doaj   +1 more source

Flippable Edges in Triangulations on Surfaces

open access: yesDiscussiones Mathematicae Graph Theory, 2022
Concerning diagonal flips on triangulations, Gao et al. showed that any triangulation G on the sphere with n ≥ 5 vertices has at least n − 2 flippable edges.
Ikegami Daiki, Nakamoto Atsuhiro
doaj   +1 more source

Efficacy and field safety of ilunocitinib for the control of atopic dermatitis in client‐owned dogs: A multicentre, double‐masked, randomised, placebo‐controlled clinical trial

open access: yesVeterinary Dermatology, Volume 36, Issue 5, Page 647-659, October 2025.
Background – Inhibition of the Janus kinase (JAK) pathway is a well‐established option for canine atopic dermatitis (cAD). Objective – To evaluate the efficacy and safety of ilunocitinib, a novel JAK inhibitor for the control of pruritus and skin lesions in client‐owned dogs with cAD.
Sophie Forster   +5 more
wiley   +1 more source

A subexponential construction of graph coloring for multiparty computation

open access: yesJournal of Mathematical Cryptology, 2014
We show the first deterministic construction of an unconditionally secure multiparty computation (MPC) protocol in the passive adversarial model over black-box non-Abelian groups which is both optimal (secure against an adversary who possesses any ...
Asghar Hassan Jameel   +3 more
doaj   +1 more source

A generalization of Vassiliev's planarity criterion [PDF]

open access: yes, 2012
Motivated by his studies in knot theory V. Vassiliev introduced $X$-graphs as regular 4-valent graph with a structure of pairs of opposite edges at each vertex.
Friesen, Tyler
core  

3-regular colored graphs and classification of surfaces

open access: yes, 2017
Motivated by the theory of crystallizations, we consider an equivalence relation on the class of $3$-regular colored graphs and prove that up to this equivalence (a) there exists a unique contracted 3-regular colored graph if the number of vertices is ...
Basak, Biplab
core   +1 more source

Home - About - Disclaimer - Privacy