Found: 55
Select item for more details and to access through your institution.
Two Disjoint Independent Bases in Matroid-Graph Pairs.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1107, doi. 10.1007/s00373-014-1439-8
- By:
- Publication type:
- Article
Note on Distance Magic Products $$G\circ C_4$$.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1117, doi. 10.1007/s00373-014-1453-x
- By:
- Publication type:
- Article
Distance Magic Labeling and Two Products of Graphs.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1125, doi. 10.1007/s00373-014-1455-8
- By:
- Publication type:
- Article
Classification of Symmetric Tabačjn Graphs.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1137, doi. 10.1007/s00373-014-1447-8
- By:
- Publication type:
- Article
Tutte Polynomials and a Stronger Version of the Akiyama-Harary Problem.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1155, doi. 10.1007/s00373-014-1440-2
- By:
- Publication type:
- Article
Total Domination Edge Critical Graphs with Total Domination Number Three and Many Dominating Pairs.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1163, doi. 10.1007/s00373-014-1469-2
- By:
- Publication type:
- Article
Facial Parity 9-Edge-Coloring of Outerplane Graphs.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1177, doi. 10.1007/s00373-014-1472-7
- By:
- Publication type:
- Article
Non-minimal Degree-Sequence-Forcing Triples.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1189, doi. 10.1007/s00373-014-1450-0
- By:
- Publication type:
- Article
A Bivariate Chromatic Polynomial for Signed Graphs.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1211, doi. 10.1007/s00373-014-1481-6
- By:
- Publication type:
- Article
Critically Twin Primitive 2-Structures.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1223, doi. 10.1007/s00373-014-1436-y
- By:
- Publication type:
- Article
Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1249, doi. 10.1007/s00373-014-1461-x
- By:
- Publication type:
- Article
On Cartesian Products Having a Minimum Dominating Set that is a Box or a Stairway.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1263, doi. 10.1007/s00373-014-1486-1
- By:
- Publication type:
- Article
Blocking the $$k$$ -Holes of Point Sets in the Plane.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1271, doi. 10.1007/s00373-014-1488-z
- By:
- Publication type:
- Article
Existence of Yang Hui Type Magic Squares.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1289, doi. 10.1007/s00373-014-1480-7
- By:
- Publication type:
- Article
Planarity and Hyperbolicity in Graphs.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1311, doi. 10.1007/s00373-014-1459-4
- By:
- Publication type:
- Article
Sum-Paintability of Generalized Theta-Graphs.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1325, doi. 10.1007/s00373-014-1441-1
- By:
- Publication type:
- Article
Erdős-Pyber Theorem for Hypergraphs and Secret Sharing.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1335, doi. 10.1007/s00373-014-1448-7
- By:
- Publication type:
- Article
On Bounds for the Product Irregularity Strength of Graphs.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1347, doi. 10.1007/s00373-014-1458-5
- By:
- Publication type:
- Article
On the Complexity of Deciding Whether the Regular Number is at Most Two.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1359, doi. 10.1007/s00373-014-1446-9
- By:
- Publication type:
- Article
A Note on the Inducibility of $$4$$ -Vertex Graphs.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1367, doi. 10.1007/s00373-014-1475-4
- By:
- Publication type:
- Article
Binary Codes and Partial Permutation Decoding Sets from the Johnson Graphs.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1381, doi. 10.1007/s00373-014-1485-2
- By:
- Publication type:
- Article
The Existence of Semi-colorings in a Graph.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1397, doi. 10.1007/s00373-014-1445-x
- By:
- Publication type:
- Article
Projective Equivalences of k-neighbourly Polytopes.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1403, doi. 10.1007/s00373-014-1474-5
- By:
- Publication type:
- Article
Permanental Bounds of the Laplacian Matrix of Trees with Given Domination Number.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1423, doi. 10.1007/s00373-014-1451-z
- By:
- Publication type:
- Article
On Locally Gabriel Geometric Graphs.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1437, doi. 10.1007/s00373-014-1482-5
- By:
- Publication type:
- Article
Total Version of the Domination Game.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1453, doi. 10.1007/s00373-014-1470-9
- By:
- Publication type:
- Article
The Dilworth Number of Auto-Chordal Bipartite Graphs.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1463, doi. 10.1007/s00373-014-1471-8
- By:
- Publication type:
- Article
The Signless Laplacian or Adjacency Spectral Radius of Bicyclic Graphs with Given Number of Cut Edges.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1473, doi. 10.1007/s00373-014-1477-2
- By:
- Publication type:
- Article
The Backbone Coloring Problem for Bipartite Backbones.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1487, doi. 10.1007/s00373-014-1462-9
- By:
- Publication type:
- Article
Distance Constraints on Short Cycles for 3-Colorability of Planar graphs.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1497, doi. 10.1007/s00373-014-1476-3
- By:
- Publication type:
- Article
Union-Intersecting Set Systems.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1507, doi. 10.1007/s00373-014-1456-7
- By:
- Publication type:
- Article
Uniform Estimates of Nonlinear Spectral Gaps.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1517, doi. 10.1007/s00373-014-1457-6
- By:
- Publication type:
- Article
Group Chromatic Number of Halin Graphs.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1531, doi. 10.1007/s00373-014-1443-z
- By:
- Publication type:
- Article
Generalizing Vertex Pancyclic and $$k$$ -ordered Graphs.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1539, doi. 10.1007/s00373-014-1460-y
- By:
- Publication type:
- Article
Parity Subgraphs with Few Common Edges and Nowhere-Zero 5-Flow.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1555, doi. 10.1007/s00373-014-1464-7
- By:
- Publication type:
- Article
A Structural Approach for Independent Domination of Regular Graphs.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1567, doi. 10.1007/s00373-014-1454-9
- By:
- Publication type:
- Article
On the Spectra of Simplicial Rook Graphs.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1589, doi. 10.1007/s00373-014-1452-y
- By:
- Publication type:
- Article
Towards the Characterization of Finite Homomorphism-Homogeneous Oriented Graphs with Loops.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1613, doi. 10.1007/s00373-014-1435-z
- By:
- Publication type:
- Article
Asymptotic Bounds on the Equilateral Dimension of Hypercubes.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1629, doi. 10.1007/s00373-014-1473-6
- By:
- Publication type:
- Article
Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1637, doi. 10.1007/s00373-014-1467-4
- By:
- Publication type:
- Article
Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1649, doi. 10.1007/s00373-014-1483-4
- By:
- Publication type:
- Article
Spanning $$k$$ -Forests with Large Components in $$K_{1,k+1}$$ -Free Graphs.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1659, doi. 10.1007/s00373-014-1434-0
- By:
- Publication type:
- Article
A Toughness Condition for a Spanning Tree With Bounded Total Excesses.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1679, doi. 10.1007/s00373-014-1487-0
- By:
- Publication type:
- Article
On Bounding the Difference of the Maximum Degree and the Clique Number.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1689, doi. 10.1007/s00373-014-1468-3
- By:
- Publication type:
- Article
4-Cycle Systems of $$K_n - E(F^*)$$.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1703, doi. 10.1007/s00373-014-1433-1
- By:
- Publication type:
- Article
Decomposition of Complete Bipartite Digraphs and Complete Digraphs into Directed Paths and Directed Cycles of Fixed Even Length.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1715, doi. 10.1007/s00373-014-1442-0
- By:
- Publication type:
- Article
Restricted Connectivity for Some Interconnection Networks.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1727, doi. 10.1007/s00373-014-1437-x
- By:
- Publication type:
- Article
The Chvátal-Erdős Condition for a Graph to Have a Spanning Trail.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1739, doi. 10.1007/s00373-014-1484-3
- By:
- Publication type:
- Article
Total Coloring of Planar Graphs Without Chordal Short Cycles.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1755, doi. 10.1007/s00373-014-1449-6
- By:
- Publication type:
- Article
On Graphs with a Unique Perfect Matching.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1765, doi. 10.1007/s00373-014-1463-8
- By:
- Publication type:
- Article