scholarly journals Triangulations and the Hajós Conjecture

10.37236/1982 ◽  
2005 ◽  
Vol 12 (1) ◽  
Author(s):  
Bojan Mohar
Keyword(s):  
Projective Plane ◽  
Planar Graphs ◽  
The Other ◽  
Closed Surfaces ◽  
Other Hand

The Hajós Conjecture was disproved in 1979 by Catlin. Recently, Thomassen showed that there are many ways that Hajós conjecture can go wrong. On the other hand, he observed that locally planar graphs and triangulations of the projective plane and the torus satisfy Hajós Conjecture, and he conjectured that the same holds for arbitrary triangulations of closed surfaces. In this note we disprove the conjecture and show that there are different reasons why the Hajós Conjecture fails also for triangulations.

On Cycles and Connectivity in Planar Graphs

1973 ◽  
Vol 16 (2) ◽  
pp. 283-288 ◽  
Author(s):  
M. D. Plummer ◽  
E. L. Wilson
Keyword(s):  
Planar Graphs ◽  
Hamiltonian Cycle ◽  
The Other ◽  
Other Hand

Let G be a graph and ζ(G) be the greatest integer n such that every set of n points in G lies on a cycle [8]. It is clear that ζ(G)≥2 for 2-connected planar graphs. Moreover, it is easy to construct arbitrarily large 2-connected planar graphs for which ζ=2. On the other hand, by a well-known theorem of Tutte [5], [6], if G is planar and 4-connected, it has a Hamiltonian cycle, i.e., ζ(G)=|V(G)| for all 4-connected (and hence for all 5-connected) planar graphs.

scholarly journals The structure and the list 3-dynamic coloring of outer-1-planar graphs

2021 ◽  
Vol vol. 23, no. 3 (Graph Theory) ◽  
Author(s):  
Yan Li ◽  
Xin Zhang
Keyword(s):  
Planar Graph ◽  
Chromatic Number ◽  
Upper Bound ◽  
Local Structure ◽  
Planar Graphs ◽  
Minimum Degree ◽  
Outer Region ◽  
The Other ◽  
Structural Theorem ◽  
Other Hand

An outer-1-planar graph is a graph admitting a drawing in the plane so that all vertices appear in the outer region of the drawing and every edge crosses at most one other edge. This paper establishes the local structure of outer-1-planar graphs by proving that each outer-1-planar graph contains one of the seventeen fixed configurations, and the list of those configurations is minimal in the sense that for each fixed configuration there exist outer-1-planar graphs containing this configuration that do not contain any of another sixteen configurations. There are two interesting applications of this structural theorem. First of all, we conclude that every (resp. maximal) outer-1-planar graph of minimum degree at least 2 has an edge with the sum of the degrees of its two end-vertices being at most 9 (resp. 7), and this upper bound is sharp. On the other hand, we show that the list 3-dynamic chromatic number of every outer-1-planar graph is at most 6, and this upper bound is best possible.

On square-free vertex colorings of graphs

2007 ◽  
Vol 44 (3) ◽  
pp. 411-422 ◽  
Author(s):  
János Barát ◽  
Péter Varjú
Keyword(s):  
Planar Graph ◽  
Planar Graphs ◽  
Path Following ◽  
Fixed Number ◽  
The Other ◽  
Graph Colorings ◽  
Outerplanar Graphs ◽  
Free Vertex ◽  
Other Hand ◽  
Color Sequence

A sequence of symbols a1 , a2 … is called square-free if it does not contain a subsequence of consecutive terms of the form x1 , …, xm , x1 , …, xm . A century ago Thue showed that there exist arbitrarily long square-free sequences using only three symbols. Sequences can be thought of as colors on the vertices of a path. Following the paper of Alon, Grytczuk, Hałuszczak and Riordan, we examine graph colorings for which the color sequence is square-free on any path. The main result is that the vertices of any k -tree have a coloring of this kind using O ( ck ) colors if c > 6. Alon et al. conjectured that a fixed number of colors suffices for any planar graph. We support this conjecture by showing that this number is at most 12 for outerplanar graphs. On the other hand we prove that some outerplanar graphs require at least 7 colors. Using this latter we construct planar graphs, for which at least 10 colors are necessary.

scholarly journals The Size of Edge-critical Uniquely 3-Colorable Planar Graphs

10.37236/3228 ◽  
2013 ◽  
Vol 20 (3) ◽  
Author(s):  
Naoki Matsumoto
Keyword(s):  
Planar Graph ◽  
Chromatic Number ◽  
Upper Bound ◽  
Planar Graphs ◽  
Infinite Family ◽  
The Other ◽  
Other Hand ◽  
Colorable Graph

A graph $G$ is uniquely $k$-colorable if the chromatic number of $G$ is $k$ and $G$ has only one $k$-coloring up to permutation of the colors. A uniquely $k$-colorable graph $G$ is edge-critical if $G-e$ is not a uniquely $k$-colorable graph for any edge $e\in E(G)$. In this paper, we prove that if $G$ is an edge-critical uniquely $3$-colorable planar graph, then $|E(G)|\leq \frac{8}{3}|V(G)|-\frac{17}{3}$. On the other hand, there exists an infinite family of edge-critical uniquely 3-colorable planar graphs with $n$ vertices and $\frac{9}{4}n-6$ edges. Our result gives a first non-trivial upper bound for $|E(G)|$.

scholarly journals Dot Product Representations of Planar Graphs

10.37236/703 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Ross J. Kang ◽  
László Lovász ◽  
Tobias Müller ◽  
Edward R. Scheinerman
Keyword(s):  
Planar Graph ◽  
Planar Graphs ◽  
Discrete Math ◽  
The Other ◽  
Outerplanar Graphs ◽  
Product Graph ◽  
Other Hand ◽  
Vector Labelling ◽  
Dot Product

A graph $G$ is a $k$-dot product graph if there exists a vector labelling $u: V(G) \to \mathbb{R}^k$ such that $u(i)^{T}u(j) \geq 1$ if and only if $ij \in E(G)$. Fiduccia, Scheinerman, Trenk and Zito [Discrete Math., 1998] asked whether every planar graph is a $3$-dot product graph. We show that the answer is "no". On the other hand, every planar graph is a $4$-dot product graph. We also answer the corresponding questions for planar graphs of prescribed girth and for outerplanar graphs.

A study of cometary eruptions through OH radio-lines

1999 ◽  
Vol 173 ◽  
pp. 249-254
Author(s):  
A.M. Silva ◽  
R.D. Miró
Keyword(s):  
Short Duration ◽  
Growth Curves ◽  
The Other ◽  
Initial Mass ◽  
Radio Lines ◽  
Other Hand ◽  
Sudden Rise

AbstractWe have developed a model for theH2OandOHevolution in a comet outburst, assuming that together with the gas, a distribution of icy grains is ejected. With an initial mass of icy grains of 108kg released, theH2OandOHproductions are increased up to a factor two, and the growth curves change drastically in the first two days. The model is applied to eruptions detected in theOHradio monitorings and fits well with the slow variations in the flux. On the other hand, several events of short duration appear, consisting of a sudden rise ofOHflux, followed by a sudden decay on the second day. These apparent short bursts are frequently found as precursors of a more durable eruption. We suggest that both of them are part of a unique eruption, and that the sudden decay is due to collisions that de-excite theOHmaser, when it reaches the Cometopause region located at 1.35 × 105kmfrom the nucleus.

Closing the GAP—A 5Å Scanning Microscope

1969 ◽  
Vol 27 ◽  
pp. 6-7
Author(s):  
A. V. Crewe
Keyword(s):  
Normal Form ◽  
The Other ◽  
Resolving Power ◽  
Scanning Microscope ◽  
Conventional Microscope ◽  
Other Hand ◽  
Closing The Gap ◽  
Thermal Sources ◽  
Better Than ◽  
Transmission Microscope

We have become accustomed to differentiating between the scanning microscope and the conventional transmission microscope according to the resolving power which the two instruments offer. The conventional microscope is capable of a point resolution of a few angstroms and line resolutions of periodic objects of about 1Å. On the other hand, the scanning microscope, in its normal form, is not ordinarily capable of a point resolution better than 100Å. Upon examining reasons for the 100Å limitation, it becomes clear that this is based more on tradition than reason, and in particular, it is a condition imposed upon the microscope by adherence to thermal sources of electrons.

Life Beyond 1MeV

1980 ◽  
Vol 38 ◽  
pp. 30-33
Author(s):  
K.H. Westmacott
Keyword(s):  
Electron Microscopy ◽  
Past Experience ◽  
The Other ◽  
Good Case ◽  
Other Hand ◽  
The U.S

Life beyond 1MeV – like life after 40 – is not too different unless one takes advantage of past experience and is receptive to new opportunities. At first glance, the returns on performing electron microscopy at voltages greater than 1MeV diminish rather rapidly as the curves which describe the well-known advantages of HVEM often tend towards saturation. However, in a country with a significant HVEM capability, a good case can be made for investing in instruments with a range of maximum accelerating voltages. In this regard, the 1.5MeV KRATOS HVEM being installed in Berkeley will complement the other 650KeV, 1MeV, and 1.2MeV instruments currently operating in the U.S. One other consideration suggests that 1.5MeV is an optimum voltage machine – Its additional advantages may be purchased for not much more than a 1MeV instrument. On the other hand, the 3MeV HVEM's which seem to be operated at 2MeV maximum, are much more expensive.

Can the Academic Self-Concept be Positive and Realistic?

2005 ◽  
Vol 19 (3) ◽  
pp. 129-132 ◽  
Author(s):  
Reimer Kornmann
Keyword(s):  
Academic Performance ◽  
Opposite Effect ◽  
Self Esteem ◽  
Point Of View ◽  
The Other ◽  
Self Concept ◽  
High Ability ◽  
Self Image ◽  
Other Hand

Summary: My comment is basically restricted to the situation in which less-able students find themselves and refers only to literature in German. From this point of view I am basically able to confirm Marsh's results. It must, however, be said that with less-able pupils the opposite effect can be found: Levels of self-esteem in these pupils are raised, at least temporarily, by separate instruction, academic performance however drops; combined instruction, on the other hand, leads to improved academic performance, while levels of self-esteem drop. Apparently, the positive self-image of less-able pupils who receive separate instruction does not bring about the potential enhancement of academic performance one might expect from high-ability pupils receiving separate instruction. To resolve the dilemma, it is proposed that individual progress in learning be accentuated, and that comparisons with others be dispensed with. This fosters a self-image that can in equal measure be realistic and optimistic.

Stories and the Self

2020 ◽  
Vol 32 (2) ◽  
pp. 47-58 ◽  
Author(s):  
Stefan Krause ◽  
Markus Appel
Keyword(s):  
Meta Analysis ◽  
The Self ◽  
The Other ◽  
Lower Degree ◽  
Contrast Effects ◽  
Self Perception ◽  
Self Perceptions ◽  
Other Hand ◽  
The One ◽  
Implicit And Explicit

Abstract. Two experiments examined the influence of stories on recipients’ self-perceptions. Extending prior theory and research, our focus was on assimilation effects (i.e., changes in self-perception in line with a protagonist’s traits) as well as on contrast effects (i.e., changes in self-perception in contrast to a protagonist’s traits). In Experiment 1 ( N = 113), implicit and explicit conscientiousness were assessed after participants read a story about either a diligent or a negligent student. Moderation analyses showed that highly transported participants and participants with lower counterarguing scores assimilate the depicted traits of a story protagonist, as indicated by explicit, self-reported conscientiousness ratings. Participants, who were more critical toward a story (i.e., higher counterarguing) and with a lower degree of transportation, showed contrast effects. In Experiment 2 ( N = 103), we manipulated transportation and counterarguing, but we could not identify an effect on participants’ self-ascribed level of conscientiousness. A mini meta-analysis across both experiments revealed significant positive overall associations between transportation and counterarguing on the one hand and story-consistent self-reported conscientiousness on the other hand.

Sign in / Sign up

Export Citation Format

Share Document