Congressus numerantium, ISSN 0384-9864, 1970

Journal

Journal of Mathematical Analysis and Applications, ISSN 0022-247X, 10/2015, Volume 430, Issue 1, pp. 60 - 75

Under suitable restrictions on the higher order mean curvatures, we establish uniqueness results for entire graphs in a warped product space satisfying a...

Entire graphs | Higher order mean curvatures | Minimal graphs | Height function | Warped products | Radial graphs | MATHEMATICS | CONSTANT MEAN-CURVATURE | MATHEMATICS, APPLIED | SPACELIKE HYPERSURFACES | COMPLETE VERTICAL GRAPHS

Entire graphs | Higher order mean curvatures | Minimal graphs | Height function | Warped products | Radial graphs | MATHEMATICS | CONSTANT MEAN-CURVATURE | MATHEMATICS, APPLIED | SPACELIKE HYPERSURFACES | COMPLETE VERTICAL GRAPHS

Journal Article

Discrete Mathematics, ISSN 0012-365X, 11/2016, Volume 339, Issue 11, pp. 2826 - 2831

Let G=(V,E,F) be a connected plane graph, with vertex set V, edge set E, and face set F. For X∈{V,E,F,V∪E,V∪F,E∪F,V∪E∪F}, two distinct elements of X are...

List colouring | Total colouring | Entire colouring | Facial colouring | Plane graph | MATHEMATICS | THEOREM | PROOF | CHOOSABILITY | EDGE | Theorems | Planes | Facial | Lists | Graphs | Graph theory | Boundaries | Colour

List colouring | Total colouring | Entire colouring | Facial colouring | Plane graph | MATHEMATICS | THEOREM | PROOF | CHOOSABILITY | EDGE | Theorems | Planes | Facial | Lists | Graphs | Graph theory | Boundaries | Colour

Journal Article

Discrete Mathematics, Algorithms and Applications, ISSN 1793-8309, 06/2018, Volume 10, Issue 3

Journal Article

Journal of Combinatorial Theory, Series B, ISSN 0095-8956, 2011, Volume 101, Issue 6, pp. 490 - 501

It was conjectured by Kronk and Mitchem in 1973 that simple plane graphs of maximum degree Δ are entirely ( Δ + 4 ) -colourable, i.e., the vertices, edges, and...

Plane graph | Vertex–edge–face colouring | Entire colouring | Vertex-edge-face colouring | MATHEMATICS | TOTAL CHROMATIC NUMBER | THEOREM | PROOF | MAXIMUM DEGREE-7 | CHOOSABILITY | EDGE | FACES | CONJECTURE

Plane graph | Vertex–edge–face colouring | Entire colouring | Vertex-edge-face colouring | MATHEMATICS | TOTAL CHROMATIC NUMBER | THEOREM | PROOF | MAXIMUM DEGREE-7 | CHOOSABILITY | EDGE | FACES | CONJECTURE

Journal Article

Classical and Quantum Gravity, ISSN 0264-9381, 02/2015, Volume 32, Issue 3, pp. 35018 - 35034

For each spacetime of a family of static spacetimes, we prove the existence of entire spherically symmetric spacelike graphs with prescribed mean curvature...

Schwarzschild spacetime | POSITIVE RADIAL SOLUTIONS | quasilinear elliptic equation | PHYSICS, MULTIDISCIPLINARY | MINKOWSKI SPACE | Dirichlet boundary condition | singular phi-Laplacian | Reissner-Nordstrom spacetime | entire graph | HYPERSURFACES | ASTRONOMY & ASTROPHYSICS | DIRICHLET PROBLEM | prescribed mean curvature function | OPERATORS | EQUATION | PHYSICS, PARTICLES & FIELDS | Euclidean geometry | Asymptotic properties | Mathematical analysis | Constants | Graphs | Curvature | Quantum gravity | Symmetry

Schwarzschild spacetime | POSITIVE RADIAL SOLUTIONS | quasilinear elliptic equation | PHYSICS, MULTIDISCIPLINARY | MINKOWSKI SPACE | Dirichlet boundary condition | singular phi-Laplacian | Reissner-Nordstrom spacetime | entire graph | HYPERSURFACES | ASTRONOMY & ASTROPHYSICS | DIRICHLET PROBLEM | prescribed mean curvature function | OPERATORS | EQUATION | PHYSICS, PARTICLES & FIELDS | Euclidean geometry | Asymptotic properties | Mathematical analysis | Constants | Graphs | Curvature | Quantum gravity | Symmetry

Journal Article

Transactions of the American Mathematical Society, ISSN 0002-9947, 10/2008, Volume 360, Issue 10, pp. 5603 - 5627

A notion of Paley-Wiener spaces on combinatorial graphs is introduced. It is shown that functions from some of these spaces are uniquely determined by their...

Mathematical theorems | Entire functions | Uniqueness | Eigenvalues | Eigenfunctions | Mathematical functions | Laplace transformation | Mathematical inequalities | Vertices | Combinatorial laplace operator | Discrete Plancherel-Polya and Poincare inequalities | Shannon sampling | Combinatorial graph | Discrete Paley-Wiener spaces | combinatorial Laplace operator | discrete Paley-Wiener spaces | MATHEMATICS | BAND-LIMITED FUNCTIONS | SYMMETRIC-SPACES | RECONSTRUCTION | MANIFOLDS | combinatorial graph | discrete Plancherel-Polya and Poincare inequalities | QUANTUM GRAPHS

Mathematical theorems | Entire functions | Uniqueness | Eigenvalues | Eigenfunctions | Mathematical functions | Laplace transformation | Mathematical inequalities | Vertices | Combinatorial laplace operator | Discrete Plancherel-Polya and Poincare inequalities | Shannon sampling | Combinatorial graph | Discrete Paley-Wiener spaces | combinatorial Laplace operator | discrete Paley-Wiener spaces | MATHEMATICS | BAND-LIMITED FUNCTIONS | SYMMETRIC-SPACES | RECONSTRUCTION | MANIFOLDS | combinatorial graph | discrete Plancherel-Polya and Poincare inequalities | QUANTUM GRAPHS

Journal Article

Discrete Mathematics, ISSN 0012-365X, 02/2016, Volume 339, Issue 2, pp. 626 - 631

Let G=(V,E,F) be a connected, loopless, and bridgeless plane graph, with vertex set V, edge set E, and face set F. For X∈{V,E,F,V∪E,V∪F,E∪F,V∪E∪F}, two...

Edge–face colouring | Entire colouring | Plane graph | Facial colouring | Edge-face colouring | MATHEMATICS | MAXIMUM DEGREE-7 | EDGES | FACES

Edge–face colouring | Entire colouring | Plane graph | Facial colouring | Edge-face colouring | MATHEMATICS | MAXIMUM DEGREE-7 | EDGES | FACES

Journal Article

Discrete Mathematics, ISSN 0012-365X, 12/2014, Volume 336, pp. 46 - 56

A plane graph is called entirely k-colorable if for each x∈V(G)∪E(G)∪F(G), we can use k colors to assign each element x a color such that any two elements that...

Maximum degree | Entire coloring | Plane graph | MATHEMATICS

Maximum degree | Entire coloring | Plane graph | MATHEMATICS

Journal Article

Bulletin of the Brazilian Mathematical Society, ISSN 1678-7544, 06/2017, Volume 48, Issue 2, pp. 187 - 198

In this paper, we provided conditions for an entire constant mean curvature Killing graph lying inside a possible unbounded region to be necessarily a slice.

Entire graph | Constant mean curvature | Killing graph | Unbounded region | MATHEMATICS

Entire graph | Constant mean curvature | Killing graph | Unbounded region | MATHEMATICS

Journal Article

Journal de mathématiques pures et appliquées, ISSN 0021-7824, 01/2015, Volume 103, Issue 1, pp. 219 - 227

We show that under certain curvature conditions of the ambient space an entire Killing graph of constant mean curvature lying inside a slab must be a totally...

Mean curvature equation | Entire graphs | Killing graphs | MATHEMATICS | MATHEMATICS, APPLIED | OPERATORS

Mean curvature equation | Entire graphs | Killing graphs | MATHEMATICS | MATHEMATICS, APPLIED | OPERATORS

Journal Article

Communications in Contemporary Mathematics, ISSN 0219-1997, 04/2017, Volume 19, Issue 2, p. 1650006

We provide sufficient conditions for the existence of a uniparametric family of entire spacelike graphs with prescribed mean curvature in a...

Singular f-Laplacian | Quasilinear elliptic equation | Dirichlet boundary condition | Prescribed mean curvature function | Friedmann-Lemâitre-Robertson-Walker spacetime | Entire spacelike graph | MATHEMATICS, APPLIED | quasilinear elliptic equation | MINKOWSKI SPACE | singular phi-Laplacian | MATHEMATICS | NONLINEAR PROBLEMS | HYPERSURFACES | Friedmann-Lemaitre-Robertson-Walker spacetime | DIRICHLET PROBLEM | MANIFOLDS | prescribed mean curvature function | EQUATION | OPERATORS

Singular f-Laplacian | Quasilinear elliptic equation | Dirichlet boundary condition | Prescribed mean curvature function | Friedmann-Lemâitre-Robertson-Walker spacetime | Entire spacelike graph | MATHEMATICS, APPLIED | quasilinear elliptic equation | MINKOWSKI SPACE | singular phi-Laplacian | MATHEMATICS | NONLINEAR PROBLEMS | HYPERSURFACES | Friedmann-Lemaitre-Robertson-Walker spacetime | DIRICHLET PROBLEM | MANIFOLDS | prescribed mean curvature function | EQUATION | OPERATORS

Journal Article

Applied Mathematics and Information Sciences, ISSN 1935-0090, 2015, Volume 9, Issue 1, pp. 263 - 267

Journal Article

Journal of Algebra and its Applications, ISSN 0219-4988, 04/2019, Volume 18, Issue 4

In this paper, we introduce the entire graph of a module with respect to a submodule, as a generalization of the total graph of a commutative ring in the sense...

girth | total graph | zero-divisor graph | entire graph | Diameter | MATHEMATICS | COMMUTATIVE RING | MATHEMATICS, APPLIED

girth | total graph | zero-divisor graph | entire graph | Diameter | MATHEMATICS | COMMUTATIVE RING | MATHEMATICS, APPLIED

Journal Article

Journal of Combinatorial Optimization, ISSN 1382-6905, 4/2016, Volume 31, Issue 3, pp. 1221 - 1240

A plane graph $$G$$ G is entirely $$k$$ k -choosable if, for every list $$L$$ L of colors satisfying $$L(x)=k$$ L ( x ) = k for all $$x\in V(G)\cup E(G) \cup...

Convex and Discrete Geometry | Maximum degree | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Operation Research/Decision Theory | Combinatorics | Entire choosability | Optimization | Plane graph | ENTIRE CHROMATIC NUMBER | COLORINGS | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | THEOREM

Convex and Discrete Geometry | Maximum degree | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Operation Research/Decision Theory | Combinatorics | Entire choosability | Optimization | Plane graph | ENTIRE CHROMATIC NUMBER | COLORINGS | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | THEOREM

Journal Article

Applied Mathematics and Computation, ISSN 0096-3003, 08/2017, Volume 307, pp. 232 - 238

A face irregular entire k-labeling of a 2-connected plane graph G is a labeling of vertices, edges and faces of G with labels from the set {1,2,…,k} in such...

Face irregular entire labeling | Irregularity strength | Irregular assignment | Entire face irregularity strength | DENSE GRAPHS | MATHEMATICS, APPLIED | LABELINGS

Face irregular entire labeling | Irregularity strength | Irregular assignment | Entire face irregularity strength | DENSE GRAPHS | MATHEMATICS, APPLIED | LABELINGS

Journal Article

Discrete Mathematics, ISSN 0012-365X, 11/2016, Volume 339, Issue 11, pp. 2742 - 2753

A plane graph G is entirely k-choosable if, for every list L of colors satisfying L(x)=k for all x∈V(G)∪E(G)∪F(G), there exists a coloring which assigns to...

Entire choosability | Maximum degree | Plane graph | ENTIRE CHROMATIC NUMBER | MATHEMATICS | Coloring | Graphs | Graph theory | Planes | Lists | Mathematical analysis

Entire choosability | Maximum degree | Plane graph | ENTIRE CHROMATIC NUMBER | MATHEMATICS | Coloring | Graphs | Graph theory | Planes | Lists | Mathematical analysis

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 08/2017, Volume 689, pp. 108 - 116

•We prove that a toroidal graph with Δ≥10 is entirely (Δ+2)-colorable.•We establish a structural lemma about toroidal graphs.•We provide a polynomial-time...

Maximum degree | Embedded graph | Torus | Entire coloring | PLANE GRAPHS | COMPUTER SCIENCE, THEORY & METHODS | Computer science | Business schools | Algorithms

Maximum degree | Embedded graph | Torus | Entire coloring | PLANE GRAPHS | COMPUTER SCIENCE, THEORY & METHODS | Computer science | Business schools | Algorithms

Journal Article

Journal of Graph Theory, ISSN 0364-9024, 07/2013, Volume 73, Issue 3, pp. 305 - 317

Let G=(V,E,F) be a plane graph with the sets of vertices, edges, and faces V, E, and F, respectively. If one can color all elements in V∪E∪F using k colors so...

plane graph | maximum degree | entire coloring | discharging method

plane graph | maximum degree | entire coloring | discharging method

Journal Article

Publicacions Matematiques, ISSN 0214-1493, 2016, Volume 60, Issue 2, pp. 273 - 287

In this work we establish sufficient conditions to ensure that an entire spacelike graph immersed with constant mean curvature in a Lorentzian product space,...

Entire spacelike H-graphs | Lorentzian product spaces | Mean curvature | Spacelike hypersurfaces | MATHEMATICS | CONSTANT MEAN-CURVATURE | spacelike hypersurfaces | entire spacelike H-graphs | MAXIMAL SURFACES | HYPERSURFACES | mean curvature | MINKOWSKI SPACE | ROBERTSON-WALKER SPACETIMES | RIEMANNIAN-MANIFOLDS | UNIQUENESS

Entire spacelike H-graphs | Lorentzian product spaces | Mean curvature | Spacelike hypersurfaces | MATHEMATICS | CONSTANT MEAN-CURVATURE | spacelike hypersurfaces | entire spacelike H-graphs | MAXIMAL SURFACES | HYPERSURFACES | mean curvature | MINKOWSKI SPACE | ROBERTSON-WALKER SPACETIMES | RIEMANNIAN-MANIFOLDS | UNIQUENESS

Journal Article

No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.