Graph theory with applications
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- On the maximal signless Laplacian spectral radius of graphs with given matching number
- Trees with \(m\)-matchings and the fourth and fifth minimal Hosoya index
- A new sufficient condition for Hamiltonian graphs
- Bipartite toughness and \(k\)-factors in bipartite graphs
- On signed cycle domination in graphs
- Edge-connectivity and edge-disjoint spanning trees
- Minimum partition of an independence system into independent sets
- Some results on the Laplacian eigenvalues of unicyclic graphs
- Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
- On path factors of \((3,4)\)-biregular bigraphs
- On the circumference of 2-connected \(\mathcal{P}_{3}\)-dominated graphs
- On group connectivity of graphs
- The crossing number of \(C(8,2)\square P_{n}\)
- On the determination problem for \(P_{4}\)-transformation of graphs
- Degree condition for subdivisions of unicyclic graphs
- Sufficient conditions for super-arc-strongly connected oriented graphs
- Factor-critical graphs with given number of maximum matchings
- On quartic half-arc-transitive metacirculants
- Pan-connectedness of graphs with large neighborhood unions
- Higmanian rank-5 association schemes on 40 points
- On the classification of quartic half-arc-transitive metacirculants
- Some results related to the tenacity and existence of \(k\)-trees
- Groups with the same non-commuting graph.
- Trees with second minimum general Randić index for \(\alpha >0\)
- The heterochromatic cycles in edge-colored graphs
- Edge-decompositions of highly connected graphs into paths
- On \(K_{1,k}\)-factorization of bipartite multigraphs
- Degree series of the 3-harmonic graphs
- A variation of a conjecture due to Erdös and Sós
- On 2-factors with cycles containing specified vertices in a bipartite graph
- An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph
- A minimum degree condition of fractional \((k,m)\)-deleted graphs
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Up-embeddability via girth and the degree-sum of adjacent vertices
- On 2-walks in chordal planar graphs
- Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
- Dirac's type sufficient conditions for hamiltonicity and pancyclicity
- Upper embeddability, girth and the degree-sum of nonadjacent vertices
- The signless Laplacian spectral radius of graphs with given number of pendant vertices
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- Ordered interval routing schemes
- Fundamental cycles and graph embeddings
- Upper embeddability, edge independence number and girth
- Graphs isomorphic to their maximum matching graphs
- On the complexity of H-colouring planar graphs
- Ordered colourings of graphs
- Non-Hamiltonian 3-connected cubic bipartite graphs
- Long cycles generate the cycle space of a graph
- Long cycles in bipartite graphs
- No graph has a maximal 3-ring of bonds
- Similarity reconstruction of trees
- On factors with all degrees odd
- A generalization of Dirac's theorem
- Hamilton cycles in Euler tour graphs
- On the degrees of vertices in locally finite graphs which possess a certain edge deletion property
- On weakly symmetric graphs of order twice a prime
- Cycle covering in bridgeless graphs
- Connectivity in bicircular matroids
- Score vectors of Kotzig tournaments
- On shortest cocycle covers of graphs
- On the edge reconstruction of locally finite disconnected graphs with a finite number of components
- Minimum degree of a graph and the existence of k-factors
- Proof of the strong 2-cover conjecture for planar graphs
- Longest cycles in 3-connected cubic graphs
- n-connectedness in pure 2-complexes
- On Tutte polynomials and cycles of plane graphs
- Hypomorphisms, orbits, and reconstruction
- Regular subgraphs of dense graphs
- On k-leaf-connected graphs
- Graph theoretic closure properties of the family of boundary NLC graph languages
- A unified approach to visibility representations of planar graphs
- A cycle structure theorem for Hamiltonian graphs
- Nowhere-zero integral chains and flows in bidirected graphs
- Designs with mutually orthogonal resolutions
- A generalization of a result of Häggkvist and Nicoghossian
- The binding number of a graph and its circuits
- Data transfers in networks
- An efficient algorithm for multiprocessor fault diagnosis using the comparison approach
- On the Hamiltonian index
- The binding number of a graph and its triangle
- On a pursuit game played on graphs for which a minor is excluded
- Short cocircuits in binary matroids
- Isotropic systems
- Simulation of cellular compaction and internalization in mammalian embryo development. II: Models for spherical embryos
- On well-quasi-ordering-finite graphs by immersion
- The general maximum matching algorithm of Micali and Vazirani
- Graph homomorphisms into the five-cycle
- Toughness and the existence of k-factors. II
- Matching extension and the genus of a graph
- A linear-processor algorithm for depth-first search in planar graphs
- Class one graphs
- Two classes of perfect graphs
- INGRID: A graph invariant manipulator
- An efficient parallel algorithm for planarity
- Digraphs with degree equivalent induced subdigraphs
- Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
- Reducing prime graphs and recognizing circle graphs
- Some extremal results on circles containing points
- The total interval number of a graph
- On the fundamental group of 3-gems and a `planar' class of 3-manifolds
This page was built for publication: Graph theory with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3097395)
