Graphs and Combinatorics is an international journal devoted to research concerning all aspects of combinatorial mathematics. In addition to original research papers, the journal also features survey articles from authors invited by the editorial board.
Polynomial $$\\chi $$χ-Binding Functions and Forbidden Induced Subgraphs: A Survey
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-1999-0
Packing Chromatic Number of Subdivisions of Cubic Graphs
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02016-3
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-1989-2
A Monodromy Graph Approach to the Piecewise Polynomiality of Simple, Monotone and Grothendieck Dessins d’enfants Double Hurwitz Numbers
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02030-5
Ehrhart Polynomials with Negative Coefficients
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-1990-9
Graph Edge Coloring: A Survey
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-1986-5
The Full Automorphism Groups, Determining Sets and Resolving Sets of Coprime Graphs
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02014-5
Spectral Extremal Results with Forbidding Linear Forests
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-1996-3
Price of Connectivity for the Vertex Cover Problem and the Dominating Set Problem: Conjectures and Investigation of Critical Graphs
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-1981-x
Special LCD Codes from Peisert and Generalized Peisert Graphs
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02019-0
Snarks with Special Spanning Trees
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-1973-x
The Minimum Asymptotic Density of Binary Caterpillars
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-1984-7
Edge-Primitive Graphs of Prime Power Order
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-1997-2
Lower Bounds on the Uniquely Restricted Matching Number
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-1991-8
The Cyclic Edge-Connectivity of Strongly Regular Graphs
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02031-4
On Upper Total Domination Versus Upper Domination in Graphs
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02029-y
Rigid Cylindrical Frameworks with Two Coincident Points
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-1983-8
LDPC Codes from $$\\mu $$μ-Geodetic Graphs Obtained from Block Designs
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02007-4
Competition Numbers and Phylogeny Numbers: Uniform Complete Multipartite Graphs
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02023-4
A Structure of 1-Planar Graph and Its Applications to Coloring Problems
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02027-0
Bounds on the Identifying Codes in Trees
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02018-1
Cut-Colorings in Coloring Graphs
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-1985-6
Bijections of Motzkin Paths Using Shifted Riordan Decompositions
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-1982-9
On rigidity of unit-bar frameworks
来源期刊：Graphs and CombinatoricsDOI：10.14288/1.0378186
Independent Domination in Bipartite Cubic Graphs
来源期刊：Graphs and CombinatoricsDOI：10.1007/S00373-019-02043-0
$$(-1)$$(-1)-Hypomorphic Graphs with the Same 3-Element Homogeneous Subsets
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-02005-y
Optimal Multiply Constant-weight Codes from Generalized Howell Designs
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02020-7
Forbidden Pairs for Equality of Connectivity and Edge-Connectivity of Graphs
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-2003-8
Improved Bounds for Guarding Plane Graphs with Edges
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-02004-z
Complex Hadamard Matrices Attached to a 3-Class Nonsymmetric Association Scheme
来源期刊：Graphs and CombinatoricsDOI：10.1007/S00373-019-02044-Z
Critical Kernel Imperfect Problem in Generalizations of Bipartite Tournaments
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02022-5
On Rooks, Marriages, and Matchings or Steinhaus via Hall
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02015-4
Pancyclicity of 4-Connected $$\\{K_{1,3},Z_8\\}$${K1,3,Z8}-Free Graphs
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-1987-4
On the Non-Existence of srg(76, 21, 2, 7)
来源期刊：Graphs Comb.DOI：10.1007/s00373-019-02039-w
On a Question of van Aardt et al. on Destroying All Longest Cycles
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02010-9
Cayley Digraphs Associated to Arithmetic Groups
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-2002-9
Weighted Domination of Independent Sets
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02024-3
Trapezoids and Deltoids in Wide Planar Point Sets
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02009-2
Characterizations of the Simple Non-Confusing Travel Groupoids on a Finite Graph
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-1995-4
Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-1998-1
Spanning Eulerian Subgraphs of Large Size
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-1992-7
Rooted Complete Minors in Line Graphs with a Kempe Coloring
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02012-7
Every Cubic Bipartite Graph has a Prime Labeling Except $$K_{3,3}$$K3,3
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-1980-y
Hamiltonian Spectra of Graphs
来源期刊：Graphs and CombinatoricsDOI：10.1007/S00373-019-02035-0
The Ramsey Numbers of Trees Versus Generalized Wheels
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-018-1994-5
Difference Sets Disjoint from a Subgroup
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02017-2
Constructing 2-Arc-Transitive Covers of Hypercubes
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02049-8
Further Results on Existentially Closed Graphs Arising from Block Designs
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02036-z
Exceptional Balanced Triangulations on Surfaces
来源期刊：Graphs and CombinatoricsDOI：10.1007/S00373-018-2001-X
On the Sizes of Vertex-k-Maximal r-Uniform Hypergraphs
来源期刊：Graphs and CombinatoricsDOI：10.1007/s00373-019-02052-z
