scientific article; zbMATH DE number 3625415
From MaRDI portal
Publication:4187840
Cited in
(only showing first 100 items - show all)- Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle
- Proof of a conjecture of Haeggkvist on cycles and independent edges
- Cohesion and stability in graphs
- A note on the complexity of finding regular subgraphs
- On a construction of critical graphs which are not sensitive
- Randomly n-cyclic digraphs
- Eccentric graphs
- Homogeneously representable interval graphs
- Degree sets of degree uniform graphs
- Graphs with unique maximum independent sets
- Generalized complementation
- Factors of regular graphs
- Uniquely cocolourable graphs
- The ith Ramsey number for matchings
- Clique graphs of packed graphs
- Contractible edges in 3-connected graphs
- Connected graphs containing a given connected graph as a unique greatest common subgraph
- Multiterminal duality and three-terminal series-parallelness
- Ramsey numbers for unions of some cycles
- Packing trees in complete graphs
- Scattering number and extremal non-Hamiltonian graphs
- Extremal theory and bipartite graph-tree Ramsey numbers
- INGRID: A graph invariant manipulator
- Deadlock free buffer allocation in closed queueing networks
- Score sequences: Lexicographic enumeration and tournament construction
- On natural isomorphisms of cycle permutation graphs
- On the eigenvectors belonging to the minimum eigenvalue of an essentially nonnegative symmetric matrix with bipartite graph
- An approximation algorithm for the TSP
- Products of graphs with their closed-set lattices
- Transitivity of fuzzy matrices under generalized connectedness
- Factors and induced subgraphs
- Extending cycles in bipartite graphs
- On the thickness and arboricity of a graph
- Neighbourhood unions and Hamiltonian properties in graphs
- A grammatical characterization of alternating pushdown automata
- The multiplicity of 1-factors in total graphs
- A note on locally connected and Hamiltonian-connected graphs
- The cochromatic index of a graph
- Edge cosymmetric graphs
- Ramsey-minimal graphs for star-forests
- Graphs with certain families of spanning trees
- Ramsey-minimal graphs for forests
- Forbidden subgraphs and Hamiltonian properties and graphs
- Extremal regular graphs for the achromatic number
- R-domination of block graphs
- A sufficient condition for a graph to have \([a,b]\)-factors
- The bondage number of a graph
- Domatically critical and domatically full graphs
- \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems
- On the chromatic uniqueness of certain bipartite graphs
- A structure theorem for some matrix algebras
- Reconstruction of infinite graphs
- The bounded chromatic number for graphs of genus \(g\)
- A minimum 3-connectivity augmentation of a graph
- Long cycles through specified vertices in a graph
- Locating an absolute center on graphs that are almost trees
- On the length of longest dominating cycles in graphs
- Modeling uncertainty in networks
- Reverse binary graphs
- 1/2-transitive graphs of order 3p
- Covering projections of graphs preserving links of vertices and edges
- Almost self-complementary factors of complete bipartite graphs
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Spanning trees with pairwise nonadjacent endvertices
- The search for chromatically unique graphs. II
- A bibliography on chromatic polynomials
- Uniquely total colorable graphs
- Ranking by outdegree for directed graphs
- On the structure of random unlabelled acyclic graphs.
- Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
- Closure systems and their structure
- On the approximability of the maximum induced matching problem
- Constructions of sensitive graphs which are not strongly sensitive
- Spanning trees fixed by automorphisms of a graph
- An algorithm for drawing general undirected graphs
- On the intersection graph of random caps on a sphere
- The automorphism groups of some cubic Cayley graphs
- Connected graphs of genus g with complementary orbits
- A note on upper bounds for some Ramsey numbers
- Computers and discovery in algebraic graph theory
- On a condition for the union of spherical caps to be connected
- Extension of de Bruijn graph and Kautz graph
- Star arboricity of graphs
- Optimal control of multiclass parallel service systems
- Decomposition of some planar graphs into trees
- A remark on the connectivity of the complement of a 3-connected graph
- On the lower length of the closed-set lattice of a tree
- Counting extensional acyclic digraphs
- Rational RBF-based partition of unity method for efficiently and accurately approximating 3D objects
- Antiparallel \(d\)-stable traces and a stronger version of ore problem
- Axiomatizations of the and the score measures in networks
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach
- Symbolic coloured SCC decomposition
- Cut-and-project graphs and other complexes
- The maximum genus of graphs of diameter two
- \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs
- Epidemic control analysis: designing targeted intervention strategies against epidemics propagated on contact networks
- Socially structured games
- Tournaments, oriented graphs and football sequences
- On the domination number of the generalized Petersen graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187840)