The following pages link to (Q3715121):
Displaying 50 items.
- On the size of graphs of class 2 whose cores have maximum degree two (Q367049) (← links)
- Graphical cyclic permutation groups (Q465270) (← links)
- Some sufficient conditions for 1-planar graphs to be class 1 (Q484318) (← links)
- A note on certain subpolytopes of the assignment polytope associated with circulant graphs (Q583235) (← links)
- Exact epidemic models on graphs using graph-automorphism driven lumping (Q663143) (← links)
- Graphs on which a dihedral group acts edge-transitively (Q685570) (← links)
- All trees are 1-embeddable and all except stars are 2-embeddable (Q687137) (← links)
- Graphs on which a group of order \(pq\) acts edge-transitively (Q716544) (← links)
- The nil-graph of ideals of a commutative ring (Q726494) (← links)
- On the automorphism groups of edge-coloured digraphs (Q750453) (← links)
- Packing of two digraphs into a transitive tournament (Q868371) (← links)
- A note on packing trees into complete bipartite graphs and on Fishburn's conjecture (Q914692) (← links)
- The edge version of Hadwiger's conjecture (Q1011784) (← links)
- New results on chromatic index critical graphs (Q1043537) (← links)
- Some results on the complexity of families of sets (Q1176725) (← links)
- Strongly regular semi-Cayley graphs (Q1204331) (← links)
- Mutual placement of bipartite graphs (Q1309454) (← links)
- Pseudo-one-factorizations of regular graphs of odd order. II: Products of graphs (Q1322199) (← links)
- A survey of partial difference sets (Q1329113) (← links)
- Embedding graphs of small size (Q1329826) (← links)
- On the size of edge-chromatic critical graphs (Q1334940) (← links)
- Cayley, Marty and Schreier hypergraphs (Q1341254) (← links)
- A note on packing of three forests (Q1356715) (← links)
- Packing bipartite graphs (Q1356720) (← links)
- 3- and 4-critical graphs of small even order (Q1357738) (← links)
- On the complete chromatic number of Halin graphs (Q1363017) (← links)
- Remarks on the size of critical edge-chromatic graphs (Q1363711) (← links)
- Vertex-splitting and chromatic index critical graphs (Q1363752) (← links)
- Symmetry groups of Boolean functions and constructions of permutation groups (Q1378434) (← links)
- A local-sparing design methodology for fault-tolerant multiprocessors (Q1388972) (← links)
- On the size of edge chromatic critical graphs (Q1403929) (← links)
- An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree (Q1408892) (← links)
- Edge coloring of graphs with small average degrees (Q1420599) (← links)
- Recognition problems and communication complexity. (Q1422409) (← links)
- Packing of graphs and permutations -- a survey (Q1422441) (← links)
- A note on the ``packing of two copies of some trees into their third power'' (Q1431988) (← links)
- Hamiltonian decomposition of Cayley graphs of orders \(p^2\) and \(pq\) (Q1568238) (← links)
- On self-complementary supergraphs of (\(n,n\))-graphs (Q1773368) (← links)
- Cyclic automorphism groups of graphs and edge-colored graphs (Q1792057) (← links)
- A note on the total chromatic number of Halin graphs with maximum degree 4 (Q1808604) (← links)
- Packing of graphs - a survey (Q1825885) (← links)
- Measurements of edge-uncolorability (Q1827679) (← links)
- Direct product of automorphism groups of colored graphs (Q1827773) (← links)
- On the zero-divisor graph of a commutative ring (Q1883020) (← links)
- Bounds on the lower size of a 7-critical graph (Q1891429) (← links)
- Generalization of two results of Hilton on total-colourings of a graph (Q1893175) (← links)
- There are no edge-chromatic 4-critical graphs of order 12 (Q1894759) (← links)
- Packing three trees (Q1916129) (← links)
- On edge colorings of \(1\)-planar graphs (Q1944052) (← links)
- Zero-divisor graphs and total coloring conjecture (Q2156940) (← links)
