当前期刊: Journal of Graph Theory Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • Size reconstructibility of graphs
    J. Graph Theory (IF 0.922) Pub Date : 2020-08-05
    Carla Groenland; Hannah Guggiari; Alex Scott

    The deck of a graph G is given by the multiset of (unlabeled) subgraphs { G − v : v ∈ V ( G ) } . The subgraphs G − v are referred to as the cards of G . Brown and Fenner recently showed that, for n ≥ 29 , the number of edges of a graph G can be computed from any deck missing 2 cards. We show that, for sufficiently large n , the number of edges can be computed from any deck missing at most 1 20 n cards

    更新日期:2020-08-06
  • Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations
    J. Graph Theory (IF 0.922) Pub Date : 2020-07-31
    Fengming Dong; Jun Ge; Helin Gong; Bo Ning; Zhangdong Ouyang; Eng Guan Tay

    The chromatic polynomial P ( G , x ) of a graph G of order n can be expressed as ∑ i = 1 n ( − 1 ) n − i a i x i , where a i is interpreted as the number of broken‐cycle‐free spanning subgraphs of G with exactly i components. The parameter ϵ ( G ) = ∑ i = 1 n ( n − i ) a i ∕ ∑ i = 1 n a i is the mean size of a broken‐cycle‐free spanning subgraph of G . In this article, we confirm and strengthen a conjecture

    更新日期:2020-07-31
  • Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture
    J. Graph Theory (IF 0.922) Pub Date : 2020-07-18
    Behrooz Bagheri Gh; Tomas Feder; Herbert Fleischner; Carlos Subi

    We study the existence of hamiltonian cycles in plane cubic graphs G having a facial 2‐factor Q . Thus hamiltonicity in G is transformed into the existence of a (quasi) spanning tree of faces in the contraction G ∕ Q . In particular, we study the case where G is the leapfrog extension (called vertex envelope of a plane cubic graph G 0 . As a consequence we prove hamiltonicity in the leapfrog extension

    更新日期:2020-07-18
  • Zip product of graphs and crossing numbers
    J. Graph Theory (IF 0.922) Pub Date : 2020-07-14
    Zhangdong Ouyang; Yuanqiu Huang; Fengming Dong; Eng Guan Tay

    D. Bokal proved that the crossing number is additive for the zip product under the condition of having two coherent bundles in the zipped graphs. This property is very effective when dealing with the crossing numbers of (capped) Cartesian product of trees with graphs containing a dominating vertex. In this paper, we first prove that the crossing number is still additive for the zip product under a

    更新日期:2020-07-15
  • Arc‐transitive maps with underlying Rose Window graphs
    J. Graph Theory (IF 0.922) Pub Date : 2020-07-14
    Isabel Hubard; Alejandra Ramos‐Rivera; Primož Šparl

    In the late 1990s, Graver and Watkins initiated the study of all edge‐transitive maps. Recently, Gareth Jones revisited the study of such maps and suggested classifying the maps in terms of either their automorphism groups or their underlying graphs. A natural step towards classifying edge‐transitive maps is to study the arc‐transitive ones. In this paper, we investigate the connection of a class of

    更新日期:2020-07-15
  • Minimum weighted clique cover on claw‐free perfect graphs
    J. Graph Theory (IF 0.922) Pub Date : 2020-07-10
    Flavia Bonomo; Gianpaolo Oriolo; Claudia Snels

    The first combinatorial algorithm for the minimum weighted clique cover (MWCC) in a claw‐free perfect graph G due to Hsu and Nemhauser dates back to 1984. It is essentially a “dual” algorithm as it relies on any algorithm for the maximum weighted stable set (MWSS) problem in claw‐free graphs and, taking into account the best‐known complexity for the latter problem, its complexity is O ( ∣ V ( G ) ∣

    更新日期:2020-07-10
  • Multiple list coloring of 3‐choice critical graphs
    J. Graph Theory (IF 0.922) Pub Date : 2020-07-01
    Rongxing Xu; Xuding Zhu

    A graph G is called 3‐choice critical if G is not 2‐choosable but any proper subgraph is 2‐choosable. A characterization of 3‐choice critical graphs was given by Voigt in 1998. Voigt conjectured that if G is a bipartite 3‐choice critical graph, then G is ( 4 m , 2 m ) ‐choosable for every integer m . This conjecture was disproved by Meng et al. in 2017. They showed that if G = Θ r , s , t where r

    更新日期:2020-07-01
  • Proper‐walk connection number of graphs
    J. Graph Theory (IF 0.922) Pub Date : 2020-06-30
    Jørgen Bang‐Jensen; Thomas Bellitto; Anders Yeo

    This paper studies the problem of proper‐walk connection number: given an undirected connected graph, our aim is to colour its edges with as few colours as possible so that there exists a properly coloured walk between every pair of vertices of the graph, that is, a walk that does not use consecutively two edges of the same colour. The problem was already solved on several classes of graphs but still

    更新日期:2020-07-01
  • Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments
    J. Graph Theory (IF 0.922) Pub Date : 2020-06-27
    Zan‐Bo Zhang; Xiaoyan Zhang; Gregory Gutin; Dingjun Lou

    A digraph D with n vertices is Hamiltonian (pancyclic and vertex‐pancyclic, respectively) if D contains a Hamilton cycle (a cycle of every length 3 , 4 , … , n , for every vertex v ∈ V ( D ) , a cycle of every length 3 , 4 , … , n through v , respectively.) It is well‐known that a strongly connected tournament is Hamiltonian, pancyclic, and vertex pancyclic. A digraph D is cycle extendable if for every

    更新日期:2020-06-28
  • List Ramsey numbers
    J. Graph Theory (IF 0.922) Pub Date : 2020-06-27
    Noga Alon; Matija Bucić; Tom Kalvari; Eden Kuperwasser; Tibor Szabó

    We introduce a list‐coloring extension of classical Ramsey numbers. We investigate when the two Ramsey numbers are equal, and in general, how far apart they can be from each other. We find graph sequences where the two are equal and where they are far apart. For ℓ ‐uniform cliques we prove that the list Ramsey number is bounded by an exponential function, while it is well known that the Ramsey number

    更新日期:2020-06-28
  • k‐quasi‐transitive digraphs of large diameter
    J. Graph Theory (IF 0.922) Pub Date : 2020-06-27
    Jesús Alva‐Samos; César Hernández‐Cruz

    Given an integer k with k ≥ 2 , a digraph D = ( V D , A D ) is k ‐quasi‐transitive if for every u v ‐directed path of length k in D , we have ( u , v ) ∈ A D or ( v , u ) ∈ A D (or both). In this study, we prove that if k is an odd integer, k ≥ 5 , then every strong k ‐quasi‐transitive digraph of diameter at least k + 2 admits a partition of its vertex set V D = ( V 1 , V 2 ) such that D [ V 1 ] is

    更新日期:2020-06-28
  • Order plus size of τ‐critical graphs
    J. Graph Theory (IF 0.922) Pub Date : 2020-06-26
    András Gyárfás; Jenő Lehel

    Let G = ( V , E ) be a τ ‐critical graph with τ ( G ) = t . Erdős and Gallai proved that ∣ V ∣ ≤ 2 t and the bound ∣ E ∣ ≤ t + 1 2 was obtained by Erdős, Hajnal, and Moon. We give here the sharp combined bound ∣ E ∣ + ∣ V ∣ ≤ t + 2 2 and find all graphs with equality.

    更新日期:2020-06-26
  • On the existence and the enumeration of bipartite regular representations of Cayley graphs over abelian groups
    J. Graph Theory (IF 0.922) Pub Date : 2020-06-23
    Jia‐Li Du; Yan‐Quan Feng; Pablo Spiga

    In this paper, we are interested in the asymptotic enumeration of bipartite Cayley digraphs and Cayley graphs over abelian groups. Let A be an abelian group and let ι be the automorphism of A defined by a ι = a − 1 , for every a ∈ A . A Cayley graph Cay ( A , S ) is said to have an automorphism group as small as possible if Aut ( Cay ( A , S ) ) = 〈 A , ι 〉 . In this paper, we show that, except for

    更新日期:2020-06-24
  • Families in posets minimizing the number of comparable pairs
    J. Graph Theory (IF 0.922) Pub Date : 2020-06-23
    József Balogh; Šárka Petříčková; Adam Zsolt Wagner

    Given a graded poset P we say a family F ⊆ P is centered if it is obtained by ‘taking sets as close to the middle layer as possible.’ A poset P is said to have the centeredness property if for any M , among all families of size M in P , centered families contain the minimum number of comparable pairs. Kleitman showed that the Boolean lattice { 0 , 1 } n has the centeredness property. It was conjectured

    更新日期:2020-06-23
  • Short rainbow cycles in graphs and matroids
    J. Graph Theory (IF 0.922) Pub Date : 2020-06-23
    Matt DeVos; Matthew Drescher; Daryl Funk; Sebastián González Hermosillo de la Maza; Krystal Guo; Tony Huynh; Bojan Mohar; Amanda Montejano

    Let G be a simple n ‐vertex graph and c be a coloring of E ( G ) with n colors, where each color class has size at least 2. We prove that ( G , c ) contains a rainbow cycle of length at most ⌈ n 2 ⌉ , which is best possible. Our result settles a special case of a strengthening of the Caccetta‐Häggkvist conjecture, due to Aharoni. We also show that the matroid generalization of our main result also

    更新日期:2020-06-23
  • Proof of a conjecture on the nullity of a graph
    J. Graph Theory (IF 0.922) Pub Date : 2020-05-20
    Long Wang; Xianya Geng

    Let G be a finite undirected graph without loops and multiple edges. The nullity of G , written as η ( G ) , is defined to be the multiplicity of 0 as an eigenvalue of its adjacency matrix. The left problem of establishing an upper bound for an arbitrary graph in terms of order and maximum degree was recently solved by Zhou et al. Zhou et al proved that η ( G ) ≤ Δ − 1 Δ n for an arbitrary graph G

    更新日期:2020-05-20
  • Generating simple near‐bipartite bricks
    J. Graph Theory (IF 0.922) Pub Date : 2020-05-20
    Nishad Kothari; Marcelo H. de Carvalho

    A brick is a 3‐connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick G is near ‐bipartite if it has a pair of edges α and β such that G − { α , β } is bipartite and matching covered; examples are K 4 and the triangular prism C 6 ¯ . The significance of near‐bipartite bricks arises from the theory of ear decompositions of matching

    更新日期:2020-05-20
  • Partitions of hypergraphs under variable degeneracy constraints
    J. Graph Theory (IF 0.922) Pub Date : 2020-05-05
    Thomas Schweser; Michael Stiebitz

    The paper deals with partitions of hypergraphs into induced subhypergraphs satisfying constraints on their degeneracy. Our hypergraphs may have multiple edges, but no loops. Given a hypergraph H and a sequence f = ( f 1 , f 2 , … , f p ) of p ≥ 1 vertex functions f i : V ( H ) → N 0 such that f 1 ( v ) + f 2 ( v ) + ⋯ + f p ( v ) ≥ d H ( v ) for all v ∈ V ( H ) , we want to find a sequence ( H 1 ,

    更新日期:2020-05-05
  • Finding any given 2‐factor in sparse pseudorandom graphs efficiently
    J. Graph Theory (IF 0.922) Pub Date : 2020-05-05
    Jie Han; Yoshiharu Kohayakawa; Patrick Morris; Yury Person

    Given an n ‐vertex pseudorandom graph G and an n ‐vertex graph H with maximum degree at most two, we wish to find a copy of H in G , that is, an embedding φ : V ( H ) → V ( G ) so that φ ( u ) φ ( v ) ∈ E ( G ) for all u v ∈ E ( H ) . Particular instances of this problem include finding a triangle‐factor and finding a Hamilton cycle in G . Here, we provide a deterministic polynomial time algorithm

    更新日期:2020-05-05
  • Strong cliques in vertex‐transitive graphs
    J. Graph Theory (IF 0.922) Pub Date : 2020-05-03
    Ademir Hujdurović

    A clique (resp, independent set) in a graph is strong if it intersects every maximal independent set (resp, every maximal clique). A graph is clique intersect stable set (CIS) if all of its maximal cliques are strong and localizable if it admits a partition of its vertex set into strong cliques. In this paper we prove that a clique C in a vertex‐transitive graph Γ is strong if and only if ∣ C ∣ ∣ I

    更新日期:2020-05-03
  • Lines in bipartite graphs and in 2‐metric spaces
    J. Graph Theory (IF 0.922) Pub Date : 2020-05-03
    Martín Matamala; José Zamora

    The line generated by two distinct points, x and y , in a finite metric space M = ( V , d ) , is the set of points given by { z ∈ V : d ( x , y ) = | d ( x , z ) + d ( z , y ) | or d ( x , y ) = | d ( x , z ) − d ( z , y ) | } .

    更新日期:2020-05-03
  • Coloring graphs with no induced five‐vertex path or gem
    J. Graph Theory (IF 0.922) Pub Date : 2020-04-30
    Maria Chudnovsky; T. Karthick; Peter Maceli; Frédéric Maffray

    For a graph G , let χ ( G ) and ω ( G ) , respectively, denote the chromatic number and clique number of G . We give an explicit structural description of ( P 5 , gem)‐free graphs, and show that every such graph G satisfies χ ( G ) ≤ ⌈ 5 ω ( G ) 4 ⌉ . Moreover, this bound is best possible. Here a gem is the graph that consists of an induced four‐vertex path plus a vertex which is adjacent to all the

    更新日期:2020-04-30
  • Isometric subgraphs for Steiner distance
    J. Graph Theory (IF 0.922) Pub Date : 2020-02-25
    Daniel Weißauer

    Let G be a connected graph and ℓ   : E ( G ) → R + a length‐function on the edges of G . The Steiner distance sdG (A ) of A  ⊆ V (G ) within G is the minimum length of a connected subgraph of G containing A , where the length of a subgraph is the sum of the lengths of its edges. It is clear that every subgraph H  ⊆ G , endowed with the induced length‐function ℓ ∣E (H ), satisfies sdH (A ) ≥ sdG (A

    更新日期:2020-02-25
  • Multithreshold graphs
    J. Graph Theory (IF 0.922) Pub Date : 2020-02-11
    Robert E. Jamison; Alan P. Sprague

    Multithreshold graphs are defined in terms of a finite sequence of real thresholds that break the real line into a set of regions, alternating between NO and YES. If real ranks can be assigned to the vertices of a graph in such a way that two vertices are adjacent iff the sum of their ranks lies in a YES region, then that graph is a multithreshold graph with respect to the given set of thresholds.

    更新日期:2020-02-11
  • Positively curved graphs
    J. Graph Theory (IF 0.922) Pub Date : 2020-02-11
    Matthew P. Yancey

    This paper consists of two halves. In the first half of the paper, we consider real‐valued functions f whose domain is the vertex set of a graph G and that are Lipschitz with respect to the graph distance. By placing a uniform distribution on the vertex set, we treat as a random variable. We investigate the link between the isoperimetric function of G and the functions f that have maximum variance

    更新日期:2020-02-11
  • Long cycles and spanning subgraphs of locally maximal 1‐planar graphs
    J. Graph Theory (IF 0.922) Pub Date : 2020-02-10
    I. Fabrici; J. Harant; T. Madaras; S. Mohr; R. Soták; C. T. Zamfirescu

    A graph is 1‐planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for each crossing of two edges the end vertices of these edges induce a complete subgraph, then the graph is locally maximal 1‐planar . For a 3‐connected locally maximal 1‐planar graph G , we show the existence of a spanning 3‐connected

    更新日期:2020-02-10
  • Bounded‐excess flows in cubic graphs
    J. Graph Theory (IF 0.922) Pub Date : 2020-02-05
    Michael Tarsi

    An (r , α )‐bounded‐excess flow ((r , α )‐flow) in an orientation of a graph G  = (V , E ) is an assignment f  : E  → [1, r −1], such that for every vertex x  ∈ V , | ∑ e ∈ E + ( x ) f ( e ) − ∑ e ∈ E − ( x ) f ( e ) | ≤ α . E +(x ), respectively E −(x ), is the set of edges directed from, respectively toward x . Bounded‐excess flows suggest a generalization of Circular nowhere‐zero flows (cnzf), which

    更新日期:2020-02-05
  • Constructions of infinite graphs with Ramsey property
    J. Graph Theory (IF 0.922) Pub Date : 2020-02-04
    Péter Komjáth

    For every infinite cardinal λ and 2 ≤ n < ω there is a directed graph D of size λ such that D does not contain directed circuits of length ≤n and if its vertices are colored with <λ colors, then there is a monochromatic directed circuit of length n  + 1. For every infinite cardinal λ and finite graph X there is a λ ‐sized graph Y such that if the vertices of Y are colored with <λ colors, then there

    更新日期:2020-02-04
  • An improved upper bound for the grid Ramsey problem
    J. Graph Theory (IF 0.922) Pub Date : 2020-02-04
    Luka Milićević

    For a positive integer r , let G (r ) be the smallest N such that, whenever the edges of the Cartesian product K N  × K N are r ‐colored, then there is a rectangle in which both pairs of opposite edges receive the same color. In this paper, we improve the upper bounds on G (r ) by proving G ( r ) ≤ ( 1 − 1 128 r − 2 ( 1 − o ( 1 ) ) ) r ( r + 1 2 ) , for r large enough. Unlike the previous improvements

    更新日期:2020-02-04
  • Plane graphs of maximum degree Δ ≥ 7 are edge‐face (Δ + 1)‐colorable
    J. Graph Theory (IF 0.922) Pub Date : 2020-02-03
    Yiqiao Wang; Xiaoxue Hu; Weifan Wang; Ko‐Wei Lih

    A plane graph G is edge‐face k‐colorable if its edges and faces can be colored with k colors such that any two adjacent or incident elements receive different colors. It is known that every plane graph G of maximum degree Δ ≥ 8 is edge‐face (Δ + 1)‐colorable. The condition Δ ≥ 8 is improved to Δ ≥ 7 in this paper.

    更新日期:2020-02-03
  • Bounds on the localization number
    J. Graph Theory (IF 0.922) Pub Date : 2020-01-30
    Anthony Bonato; William B. Kinnersley

    We consider the localization game played on graphs, wherein a set of cops attempt to determine the exact location of an invisible robber by exploiting distance probes. The corresponding optimization parameter for a graph G is called the localization number and is written as ζ (G ). We settle a conjecture of Bosek et al by providing an upper bound on the chromatic number as a function of the localization

    更新日期:2020-01-30
  • On clique‐inverse graphs of graphs with bounded clique number
    J. Graph Theory (IF 0.922) Pub Date : 2020-01-28
    Liliana Alcón; Sylvain Gravier; Claudia L. Sales; Fabio Protti; Gabriela Ravenna

    The clique graph K (G ) of G is the intersection graph of the family of maximal cliques of G . For a family F of graphs, the family of clique‐inverse graphs of F , denoted by K − 1 ( F ) , is defined as K − 1 ( F ) = { H | K ( H ) ∈ F } . Let F p be the family of K p ‐free graphs, that is, graphs with clique number at most p  − 1, for an integer constant p  ≥ 2. Deciding whether a graph H is a clique‐inverse

    更新日期:2020-01-28
  • Partitioning a graph into cycles with a specified number of chords
    J. Graph Theory (IF 0.922) Pub Date : 2019-12-26
    Shuya Chiba; Suyun Jiang; Jin Yan

    For a graph G , let σ 2 ( G ) be the minimum degree sum of two nonadjacent vertices in G . A chord of a cycle in a graph G is an edge of G joining two nonconsecutive vertices of the cycle. In this paper, we prove the following result, which is an extension of a result of Brandt et al for large graphs: For positive integers k and c , there exists an integer f ( k , c ) such that if G is a graph of order

    更新日期:2019-12-26
  • Rainbow saturation of graphs
    J. Graph Theory (IF 0.922) Pub Date : 2019-12-20
    António Girão; David Lewis; Kamil Popielarz

    In this paper, we study the following problem proposed by Barrus, Ferrara, Vandenbussche, and Wenger. Given a graph H and an integer t , what is sat t ( n , R ( H ) ) , the minimum number of edges in a t ‐edge‐colored graph G on n vertices such that G does not contain a rainbow copy of H , but adding to G a new edge in any color from { 1 , 2 , … , t } creates a rainbow copy of H ? Here, we completely

    更新日期:2019-12-20
  • On DP‐coloring of digraphs
    J. Graph Theory (IF 0.922) Pub Date : 2019-12-17
    Jørgen Bang‐Jensen; Thomas Bellitto; Thomas Schweser; Michael Stiebitz

    DP‐coloring is a relatively new coloring concept by Dvořák and Postle and was introduced as an extension of list‐colorings of (undirected) graphs. It transforms the problem of finding a list‐coloring of a given graph G with a list‐assignment L to finding an independent transversal in an auxiliary graph with vertex set { ( v , c ) | v ∈ V ( G ) , c ∈ L ( v ) } . In this paper, we extend the definition

    更新日期:2019-12-17
  • A generalization of Tuza's conjecture
    J. Graph Theory (IF 0.922) Pub Date : 2019-12-17
    Ron Aharoni; Shira Zerbib

    A famous conjecture of Tuza is that the minimal number of edges needed to cover all triangles in a graph is at most twice the maximal size of a set of edge‐disjoint triangles. We propose a wider setting for this conjecture. For a hypergraph H let ν ( m ) ( H ) be the maximal size of a collection of edges, no two of which share m or more vertices, and let τ ( m ) ( H ) be the minimal size of a collection

    更新日期:2019-12-17
  • Vertex‐disjoint properly edge‐colored cycles in edge‐colored complete graphs
    J. Graph Theory (IF 0.922) Pub Date : 2019-12-17
    Ruonan Li; Hajo Broersma; Shenggui Zhang

    It is conjectured that every edge‐colored complete graph G on n vertices satisfying Δ m o n ( G ) ≤ n − 3 k + 1 contains k vertex‐disjoint properly edge‐colored cycles. We confirm this conjecture for k = 2 , prove several additional weaker results for general k , and we establish structural properties of possible minimum counterexamples to the conjecture. We also reveal a close relationship between

    更新日期:2019-12-17
  • Graph homomorphism reconfiguration and frozen H‐colorings
    J. Graph Theory (IF 0.922) Pub Date : 2019-12-09
    Richard C. Brewster; Jae‐Baek Lee; Benjamin Moore; Jonathan A. Noel; Mark Siggers

    For a fixed graph H, the reconfiguration problem for H‐colorings (ie, homomorphisms to H) asks: given a graph G and two H‐colorings φ and ψ of G, does there exist a sequence f 0 , … , f m of H‐colorings such that f 0 = φ , f m = ψ , and f i ( u ) f i + 1 ( v ) ∈ E ( H ) for every 0 ≤ i < m and u v ∈ E ( G ) ? If the graph G is loop‐free, then this is the equivalent to asking whether it possible to

    更新日期:2019-12-09
  • Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1‐Sperner hypergraphs
    J. Graph Theory (IF 0.922) Pub Date : 2019-12-04
    Endre Boros; Vladimir Gurvich; Martin Milanič

    A hypergraph is said to be 1‐Sperner if for every two hyperedges the smallest of their two set differences is of size one. We present several applications of 1 ‐Sperner hypergraphs to graphs. First, we consider several ways of associating hypergraphs to graphs, namely, vertex cover, clique, independent set, dominating set, and closed neighborhood hypergraphs. For each of them, we characterize graphs

    更新日期:2019-12-04
  • Tree matchings
    J. Graph Theory (IF 0.922) Pub Date : 2019-11-27
    Alexander Roberts

    An ( s , t ) ‐matching in a bipartite graph G = ( U , V , E ) is a subset of the edges F such that each component of H = ( U , V , F ) is a tree with at most t edges and each vertex in U has s neighbours in H . We give sharp sufficient neighbourhood‐conditions for a bipartite graph to contain an ( s , t ) ‐matching. As a special case, we prove a conjecture of Bennett, Bonacina, Galesi, Huynh, Molloy

    更新日期:2019-11-27
  • Hamiltonian cycles in 3‐tough 2K2‐free graphs
    J. Graph Theory (IF 0.922) Pub Date : 2019-11-27
    Songling Shan

    A graph is called 2 K 2 ‐free if it does not contain two independent edges as an induced subgraph. Broersma, Patel, and Pyatkin showed that every 25‐tough 2 K 2 ‐free graph with at least three vertices is Hamiltonian. In this paper, we improve the required toughness in this result from 25 to 3.

    更新日期:2019-11-27
  • Well‐quasi‐ordering and finite distinguishing number
    J. Graph Theory (IF 0.922) Pub Date : 2019-11-26
    Aistis Atminas; Robert Brignall

    Balogh, Bollobás and Weinreich showed that a parameter that has since been termed the distinguishing number can be used to identify a jump in the possible speeds of hereditary classes of graphs at the sequence of Bell numbers. We prove that every hereditary class that lies above the Bell numbers and has finite distinguishing number contains a boundary class for well‐quasi‐ordering. This means that

    更新日期:2019-11-26
  • Sequentially embeddable graphs
    J. Graph Theory (IF 0.922) Pub Date : 2019-11-25
    Jackson Autry; Christopher O'Neill

    We call a (not necessarily planar) embedding of a graph G in the plane sequential if its vertices lie in Z 2 and the line segments between adjacent vertices contain no interior integer points. In this note, we prove (a) a graph G has a sequential embedding if and only if G is 4‐colorable and (b) if G is planar, then G has a sequential planar embedding.

    更新日期:2019-11-25
  • Matchings in k‐partite k‐uniform hypergraphs
    J. Graph Theory (IF 0.922) Pub Date : 2019-11-25
    Jie Han; Chuanyun Zang; Yi Zhao

    For k ≥ 3 and ϵ > 0 , let H be a k ‐partite k ‐graph with parts V 1 , … , V k each of size n , where n is sufficiently large. Assume that for each i ∈ [ k ] , every ( k − 1 ) ‐set in ∏ j ∈ [ k ] \ { i } V j lies in at least a i edges, and a 1 ≥ a 2 ≥ ⋯ ≥ a k . We show that if a 1 , a 2 ≥ ϵ n , then H contains a matching of size min { n − 1 , ∑ i ∈ [ k ] a i } . In particular, H contains a matching

    更新日期:2019-11-25
  • An Ore‐type condition for large k‐factor and disjoint perfect matchings
    J. Graph Theory (IF 0.922) Pub Date : 2019-11-25
    Hongliang Lu; Bo Ning

    Win conjectured that a graph G on n vertices contains k disjoint perfect matchings, if the degree sum of any two nonadjacent vertices is at least n + k − 2 , where n is even and n ≥ k + 2 . In this paper, we prove that Win's conjecture is true for k ≥ n ∕ 2 , where n is sufficiently large. To show this result, we prove a theorem on k ‐factor in a graph under some Ore‐type condition. Our main tools

    更新日期:2019-11-25
  • Few H copies in F‐saturated graphs
    J. Graph Theory (IF 0.922) Pub Date : 2019-11-25
    Jürgen Kritschgau; Abhishek Methuku; Michael Tait; Craig Timmons

    A graph is F ‐saturated if it is F ‐free but the addition of any edge creates a copy of F . In this paper we study the function sat ( n , H , F ) which is the minimum number of copies of H that an F ‐saturated graph on n vertices may contain. This function is a natural saturation analogue of Alon and Shikhelman's generalized Turán problem, and letting H = K 2 recovers the well‐studied saturation function

    更新日期:2019-11-25
  • Improved bounds for minimal feedback vertex sets in tournaments.
    J. Graph Theory (IF 0.922) Pub Date : 2018-06-05
    M Mnich,E Teutrine

    We study feedback vertex sets (FVS) in tournaments, which are orientations of complete graphs. As our main result, we show that any tournament on n nodes has at most 1.5949 n minimal FVS. This significantly improves the previously best upper bound of 1.6667 n by Fomin et al. [STOC 2016] and 1.6740 n by Gaspers and Mnich [J. Graph Theory72(1):72-89, 2013]. Our new upper bound almost matches the best-known

    更新日期:2019-11-01
  • Monochromatic Clique Decompositions of Graphs.
    J. Graph Theory (IF 0.922) Pub Date : 2015-12-01
    Henry Liu,Oleg Pikhurko,Teresa Sousa

    Let G be a graph whose edges are colored with k colors, and H=(H1,⋯,Hk) be a k-tuple of graphs. A monochromatic H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a monochromatic copy of Hi in color i, for some 1≤i≤k. Let φk(n,H) be the smallest number ϕ, such that, for every order-n graph and every k-edge-coloring, there is a monochromatic

    更新日期:2019-11-01
  • On dihedral flows in embedded graphs.
    J. Graph Theory (IF 0.922) Pub Date : null
    Bart Litjens

    Let Γ be a multigraph with for each vertex a cyclic order of the edges incident with it. For n ≥ 3 , let D 2 n be the dihedral group of order 2 n . Define D ≔ { ( ± 1 a 0 1 ) ∣ a ∈ Z } . Goodall et al in 2016 asked whether Γ admits a nowhere-identity D 2 n -flow if and only if it admits a nowhere-identity D -flow with ∣ a ∣ < n (a "nowhere-identity dihedral n -flow"). We give counterexamples to this

    更新日期:2019-11-01
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
欢迎访问IOP中国网站
自然职场线上招聘会
GIANT
产业、创新与基础设施
自然科研线上培训服务
材料学研究精选
胸腔和胸部成像专题
屿渡论文,编辑服务
何川
苏昭铭
陈刚
姜涛
李闯创
李刚
北大
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
天合科研
x-mol收录
上海纽约大学
陈芬儿
厦门大学
何振宇
史大永
吉林大学
卓春祥
张昊
杨中悦
试剂库存
down
wechat
bug