Results 201 to 210 of about 4,959 (254)

Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT A (2‐dimensional) realisation of a graph G $G$ is a pair ( G , p ) $(G,p)$, where p $p$ maps the vertices of G $G$ to R 2 ${{\mathbb{R}}}^{2}$. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise.
Katie Clinch   +5 more
wiley   +1 more source

Additivity and Chain Rules for Quantum Entropies via Multi-index Schatten Norms. [PDF]

open access: yesCommun Math Phys
Fawzi O   +3 more
europepmc   +1 more source

Weak Degeneracy of Planar Graphs

open access: yesJournal 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   +2 more
wiley   +1 more source

Linear Versus Centred Colouring via Pseudogrids

open access: yesJournal 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   +4 more
wiley   +1 more source

Home - About - Disclaimer - Privacy