AbstractUsing an inclusion-exclusion formula for the symmetric difference and its associated Bonferroni inequalities, some extremal and divisibility properties for the number of negative p-cycles of Kn are deduced. It is also shown that the asymptotic probability that a p-cycle of Kn is negative does not depend on the structure of the subgraph spanned by negative edges provided this subgraph has bounded degrees
This thesis will study a variety of problems in graph theory. Initially, the focus will be on findin...
The following two conjectures arose in the work of Grimmett and Winkler, and Pemantle: the uniforml...
Given a graph G = (V,E) and a weight function on the edges w: E 7→ R, we consider the polyhedron P (...
AbstractIn this paper the problem of characterizing extremal graphsKnrelatively to the number of neg...
It is known that signed graphs with all cycles negative are those in which each block is a negative ...
We show that generating all negative cycles of a weighted graph is a hard enumeration problem, in bo...
summary:In our earlier paper [9], generalizing the well known notion of graceful graphs, a $(p,m,n)...
AbstractA signed graph based on F is an ordinary graph F with each edge marked as positive or negati...
We show that generating all negative cycles of a weighted graph is a hard enumeration problem, in bo...
It is known that signed graphs with all cycles negative are those in which each block is a negative ...
AbstractDefine a chordally signed graph to be a signed chordal graph (meaning that each edge is desi...
AbstractA signed graph has a plus or minus sign on each edge. A simple cycle is positive or negative...
AbstractA projective-planar signed graph has no two vertex-disjoint negative circles. We prove that ...
AbstractThe zero-free chromatic number χ∗ of a signed graph ∑ is the smallest positive number k for ...
Let G = (V,E) be a graph. A function f: V (G) → {−1, 1} is called negative if v∈N [v] f(v) ≤ 1 for ...
This thesis will study a variety of problems in graph theory. Initially, the focus will be on findin...
The following two conjectures arose in the work of Grimmett and Winkler, and Pemantle: the uniforml...
Given a graph G = (V,E) and a weight function on the edges w: E 7→ R, we consider the polyhedron P (...
AbstractIn this paper the problem of characterizing extremal graphsKnrelatively to the number of neg...
It is known that signed graphs with all cycles negative are those in which each block is a negative ...
We show that generating all negative cycles of a weighted graph is a hard enumeration problem, in bo...
summary:In our earlier paper [9], generalizing the well known notion of graceful graphs, a $(p,m,n)...
AbstractA signed graph based on F is an ordinary graph F with each edge marked as positive or negati...
We show that generating all negative cycles of a weighted graph is a hard enumeration problem, in bo...
It is known that signed graphs with all cycles negative are those in which each block is a negative ...
AbstractDefine a chordally signed graph to be a signed chordal graph (meaning that each edge is desi...
AbstractA signed graph has a plus or minus sign on each edge. A simple cycle is positive or negative...
AbstractA projective-planar signed graph has no two vertex-disjoint negative circles. We prove that ...
AbstractThe zero-free chromatic number χ∗ of a signed graph ∑ is the smallest positive number k for ...
Let G = (V,E) be a graph. A function f: V (G) → {−1, 1} is called negative if v∈N [v] f(v) ≤ 1 for ...
This thesis will study a variety of problems in graph theory. Initially, the focus will be on findin...
The following two conjectures arose in the work of Grimmett and Winkler, and Pemantle: the uniforml...
Given a graph G = (V,E) and a weight function on the edges w: E 7→ R, we consider the polyhedron P (...
DOI
Add to ORKG