Results 201 to 210 of about 17,772 (305)

Weak Degeneracy of Planar Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT The weak degeneracy of a graph G $G$ is a numerical parameter that was recently introduced by the first two authors with the aim of understanding the power of greedy algorithms for graph coloring. Every d $d$‐degenerate graph is weakly d $d$‐degenerate, but the converse is not true in general (e.g., all connected d $d$‐regular graphs except ...
Anton Bernshteyn, Eugene Lee, Evelyne Smith‐Roberge   +2 more
wiley   +1 more source

An Inverse Signorini Obstacle Problem. [PDF]

Arch Ration Mech Anal
de Hoop MV, Lassas M, Lu J, Oksanen L, Zhao Z.   +4 more
europepmc   +1 more source

Linear Versus Centred Colouring via Pseudogrids

Journal of Graph Theory, EarlyView.
ABSTRACT A centred colouring of a graph is a vertex colouring in which every connected subgraph contains a vertex whose colour is unique and a linear colouring is a vertex colouring in which every (not‐necessarily induced) path contains a vertex whose colour is unique. For a graph G $G$, the centred chromatic number χ cen ( G ) ${\chi }_{\text{cen}}(G)$
Prosenjit Bose, Vida Dujmović, Hussein Houdrouge, Mehrnoosh Javarsineh, Pat Morin   +4 more
wiley   +1 more source

Stochastic Reaction Networks Within Interacting Compartments with Content-Dependent Fragmentation. [PDF]

Bull Math Biol
Anderson DF, Howells AS, La Luz DR.
europepmc   +1 more source

A Min–Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs

Journal of Graph Theory, EarlyView.
ABSTRACT In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted digraph, the minimum weight of a dicut is equal to the maximum size of a packing of dijoins. This has been disproved. However, the unweighted version conjectured by
Gérard Cornuéjols, Siyue Liu, R. Ravi
wiley   +1 more source

Evolution Equations on Co-evolving Graphs: Long-Time Behaviour and the Graph-Continuity Equation. [PDF]

J Nonlinear Sci
Carrillo JA, Esposito A, Mikolás L.
europepmc   +1 more source

SATCHMO: A Theorem Prover Implemented in Prolog [PDF]

, 1988
Bry, François, Manthey, Rainer, Lusk, Ewing   +2 more
core   +1 more source

An End Degree for Digraphs

Journal of Graph Theory, EarlyView.
ABSTRACT In this paper we define a degree for ends of infinite digraphs. The well‐definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices dominating the end, which we denote as combined end degree.
Matthias Hamann, Karl Heuer
wiley   +1 more source

A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games. [PDF]

Algorithmica
Benford A, Lehre PK.
europepmc   +1 more source

On Fork‐Free t‐Perfect Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5 ${P}_{5}$‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]
Yixin Cao, Shenghua Wang
wiley   +1 more source