EuDML | Browse

The search session has expired. Please query the service again.

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Displaying 21 – 40 of 227

Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles

Donghan Zhang (2022)

Czechoslovak Mathematical Journal

Let $G = (V (G), E (G))$ be a simple graph and $E_{G} (v)$ denote the set of edges incident with a vertex $v$ . A neighbor sum distinguishing (NSD) total coloring $φ$ of $G$ is a proper total coloring of $G$ such that $\sum_{z \in E_{G} (u) \cup {u}} φ (z) \neq \sum_{z \in E_{G} (v) \cup {v}} φ (z)$ for each edge $u v \in E (G)$ . Pilśniak and Woźniak asserted in 2015 that each graph with maximum degree $Δ$ admits an NSD total $(Δ + 3)$ -coloring. We prove that the list version of this conjecture holds for any IC-planar graph with $Δ \geq 11$ but without $5$ -cycles by applying the Combinatorial Nullstellensatz.

Neighborhood conditions and fractional $k$ -factors.

Zhou, Sizhong, Liu, Hongxia (2009)

Bulletin of the Malaysian Mathematical Sciences Society. Second Series

Neighborhoods in line graphs

Ľubomír Šoltés (1990)

Acta Universitatis Carolinae. Mathematica et Physica

Neighborly Maps with Few Vertices.

T. L. Snyder (1992)

Discrete & computational geometry

Neighbour-distinguishing edge colourings of random regular graphs.

Greenhill, Catherine, Ruciński, Andrzej (2006)

The Electronic Journal of Combinatorics [electronic only]

Neighbourhood digraphs

Bohdan Zelinka (1987)

Archivum Mathematicum

Neighbourhood realizations of complements of intersection graphs

Bohdan Zelinka (1989)

Mathematica Slovaca

Neighbourhood tournaments

Bohdan Zelinka (1986)

Mathematica Slovaca

Neighbourhoods in line graphs

Ľubomír Šoltés (1992)

Mathematica Slovaca

Několik kapitol z nauky o číslech

Emil Schönbaum (1905)

Časopis pro pěstování mathematiky a fysiky

Některé relace mezi kombinačními čísly $p (n)$

Robert Karpe (1969)

Časopis pro pěstování matematiky

Neochromatica

Panagiotis Cheilaris, Ernst Specker, Stathis Zachos (2010)

Commentationes Mathematicae Universitatis Carolinae

We create and discuss several modifications to traditional graph coloring. In particular, we classify various notions of coloring in a proper hierarchy. We concentrate on grid graphs whose colorings can be represented by natural number entries in arrays with various restrictions.

Nestandardní zápisy čísel

Edita Pelantová, Štepán Starosta (2011)

Pokroky matematiky, fyziky a astronomie

Nets, $(t, s)$ -sequences, and algebraic curves over finite fields with many rational points.

Niederreiter, Harald (1998)

Documenta Mathematica

Netted matrices.

Stănică, Pantelimon (2003)

International Journal of Mathematics and Mathematical Sciences

Network tomography.

Berenstein, Carlos A., Gavilánez, Franklin (2007)

Revista Colombiana de Matemáticas

Neue ergebnisse der theorie der hypergraphen mit anwendungen in der informationtheorie.

G. Schrage (1977)

Collectanea Mathematica

Neuwirth manifolds and colourings of graphs.

Alberto Cavicchioli (1992)

Aequationes mathematicae

New adventures in the land of $q$ -analogues (Yang-Baxter equations). (Nouvelles aventures au pays des $q$ -analogues (équation de Yang-Baxter).)

Cartier, Pierre (1990)

Séminaire Lotharingien de Combinatoire [electronic only]

New Binary Extremal Self-Dual Codes of Lengths 50 and 52

Buyuklieva, Stefka (1999)

Serdica Mathematical Journal

* This work was partially supported by the Bulgarian National Science Fund under Contract No. MM – 503/1995.New extremal binary self-dual codes of lengths 50 and 52 are constructed. Some of them are the first known codes with such weight enumerators. The structure of their automorphisms groups are shown.

Currently displaying 21 – 40 of 227

Previous Page 2 Next